AC

#include <bits/stdc++.h>
using namespace std;
string s[3010], minn[3010], maxn[3010];
int n, m;

int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> s[i];
		minn[i] = s[i];
		sort(minn[i].begin(), minn[i].end());
		maxn[i] = minn[i];
		reverse(maxn[i].begin(), maxn[i].end());
	}
	for (int i = 0; i < n; i++) {
		int flag = 0;
		for (int j = 0; j < n; j++) {
			if (i == j)
				continue;
			else {
				if (minn[i] > maxn[j]) {
					flag = 1;
					break;
				}

			}
		}
		if (flag == 1)
			cout << 0;
		else
			cout << 1;
	}

	return 0;
}