#include<bits/stdc++.h>
using namespace std;
const int N = 3005;
struct Node
{
	int maxn;
	int minn;
}s[N];
int n,m;
int main()
{
	cin>>n>>m;
	for(int i = 1;i <= n;i ++)
	{
		string a;
		int maxx = 1000100,minx = 0;
		for(int j = 1;j <= m;j ++)
		{
		    cin>>a[j];
			maxx = min(maxx,(int)a[j]);
			minx = max(minx,(int)a[j]);
		}
		s[i] = {minx,maxx};
	}
	for(int i = 1;i <= n;i ++)
	{
		bool flag = false;
		for(int j = 1;j <= n;j ++)
		{
			if(s[i].minn >= s[j].maxn&&j!=i)
			{
			    flag = true;
			    break;
			}
		}
		if(flag == true)
		cout<<0;
		else cout<<1;
	}
	return 0;
}