#include <bits/stdc++.h> using namespace std; const int N = 4001; int n, m, a1[N], a2[N]; char z[N]; int main() { freopen("dict.in", "r", stdin); freopen("dict.out", "w", stdout); scanf("%d%d", &n, &m); for (int i = 1; i <= n; ++i) { scanf("%s", z + 1); a1[i] = 26, a2[i] = 0; for (int j = 1; j <= m; ++j) { a1[i] = min(a1[i], z[j] - 'a'); a2[i] = max(a2[i], z[j] - 'a'); } } if (n == 1) { printf("1\n"); return 0; } int x1 = 1; for (int i = 1; i <= n; ++i) { if (a2[i] < a2[x1]) x1 = i; } int x2 = (x1 == 1 ? 2 : 1); for (int i = 1; i <= n; ++i) { if (i == x1) continue; if (a2[i] < a2[x2]) x2 = i; } for (int i = 1; i <= n; ++i) { if (i != x1 ? a1[i] < a2[x1] : a1[i] < a2[x2]) printf("1"); else printf("0"); } printf("\n"); return 0; }