#include<bits/stdc++.h>
#define N 3010
using namespace std;
int n, len, num;
char s[N][N], mins[N], l[N];
int chaek(char a[], char b[]) {
	for (int i = 0; i < len; i++) {
		if (a[i] < b[i])return -1;
		if (a[i] > b[i])return 1;
	}
	return 0;
}
int main() {
	cin >> n >> len;
	if (len == 1 && n == 1) {
		cout << 1;
		return 0;
	}
	for (int j = 0; j < len; j++)
		mins[j] = 114;
	for (int i = 1; i <= n; i++) {
		cin >> s[i];
		if (mins == s[i])num++;
		if (chaek(s[i], mins) == -1) {
			for (int j = 0; j < len; j++)
				mins[j] = s[i][j];
			num = 0;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < len; j++)
			l[j] = s[i][j];
		sort(l, l + len);
		if (chaek(l, mins) == -1)
			cout << 1;
		else if (chaek(s[i], mins) == 0) {
			if (!num)
				cout << 1;
		} else cout << 0;
	}
	return 0;
}