#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


const int maxn=3e5+10;

int n,m;

int rez[2][maxn];

int main(){

    ///freopen("test.txt","r",stdin);

    scanf("%d %d",&n,&m);
    map<int,vector<pair<int,pii>>>mapax,mapay;
    for(int i=1;i<=n;i++){
        int x,y;
        scanf("%d %d",&x,&y);
        mapax[x].pb({y,{i,0} });
        mapay[y].pb({x,{i,0} });
    }

    for(int i=1;i<=m;i++){
        int x,y;
        scanf("%d %d",&x,&y);
        mapax[x].pb({y,{i,1} });
        mapay[y].pb({x,{i,1} });
    }


    for(auto it=mapax.begin();it!=mapax.end();it++){
        vector<pair<int,pii>>&a=it->ss;
        sort(a.begin(),a.end());
        for(int i=1;i<a.size();i++){
            if(a[i].ss.ss!=a[i-1].ss.ss){
                rez[a[i].ss.ss][a[i].ss.ff]=1;
                rez[a[i-1].ss.ss][a[i-1].ss.ff]=1;
            }
        }

    }
    for(auto it=mapay.begin();it!=mapay.end();it++){
        vector<pair<int,pii>>&a=it->ss;
        sort(a.begin(),a.end());
        for(int i=1;i<a.size();i++){
            if(a[i].ss.ss!=a[i-1].ss.ss){
                rez[a[i].ss.ss][a[i].ss.ff]=1;
                rez[a[i-1].ss.ss][a[i-1].ss.ff]=1;
            }
        }
    }

    for(int i=1;i<=n;i++)printf("%d",rez[0][i]);
    printf("\n");
    for(int i=1;i<=m;i++)printf("%d",rez[1][i]);
    printf("\n");


    return 0;
}