# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=1e6+5;
struct node{
	int x,y,idx,player;
}a[M];
bool cmp1(node &a1,node &a2)
{
	if(a1.x==a2.x)
	return a1.y<a2.y;
	else return a1.x<a2.x;
}
bool cmp2(node &a1,node &a2)
{
	if(a1.y==a2.y)
	return a1.x<a2.x;
	else return a1.y<a2.y;
}
bool va[M],vb[M];
int n1,n2;
int main()
{
	cin>>n1>>n2;
	for(int i=1;i<=n1;i++)
	{
		cin>>a[i].x>>a[i].y;
		a[i].player=1;
		a[i].idx=i;
	}
	for(int i=n1+1;i<=n1+n2;i++)
	{
		cin>>a[i].x>>a[i].y;
		a[i].player=2;
		a[i].idx=i-n1;
	}
	sort(a+1,a+n1+n2+1,cmp1);
	for(int i=2;i<=n1+n2;i++)
	{
		if(a[i].x!=a[i-1].x) continue;
		if(a[i].player==a[i-1].player) continue;
		if(a[i].player==1)
		{
			va[a[i].idx]=vb[a[i-1].idx]=1;
		}
		else	va[a[i-1].idx]=vb[a[i].idx]=1;
	}
		sort(a+1,a+n1+n2+1,cmp2);
	for(int i=2;i<=n1+n2;i++)
	{
		if(a[i].y!=a[i-1].y) continue;
		if(a[i].player==a[i-1].player) continue;
		if(a[i].player==1)
		{
			va[a[i].idx]=vb[a[i-1].idx]=1;
		}
		else	va[a[i-1].idx]=vb[a[i].idx]=1;
	}
	for(int i=1;i<=n1;i++)
	{
		cout<<va[i];
	}
	cout<<endl;
	for(int i=1;i<=n2;i++) cout<<vb[i];
}