#include<bits/stdc++.h>
#define endl "\n"
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 50, M = 1e5 + 50, inf = 0x3f3f3f3f, P = 13331;
const ll INF = 0x3f3f3f3f3f3f3f3f;
void solve() {
    int n1, n2;
    cin >> n1 >> n2;

    map<int, vector<int>> mpx, mpy;
    map<pii, int> id;
    
    vector<pii> p1(n1), p2(n2);
    for (int i = 0; i < n1; i++) {
        int x, y;
        cin >> x >> y;
        id[{x, y}] = 0;
        mpx[x].push_back(y);
        mpy[y].push_back(x);
        p1[i] = {x, y};
    }
    for (int i = 0; i < n2; i++) {
        int x, y;
        cin >> x >> y;
        id[{x, y}] = 1;
        mpx[x].push_back(y);
        mpy[y].push_back(x);
        p2[i] = {x, y};
    }
    for (auto &[x, v] : mpx) {
        sort(v.begin(), v.end());
    }
    for (auto &[x, v] : mpy) {
        sort(v.begin(), v.end());
    }
    for (int i = 0; i < n1; i++) {
        auto [x, y] = p1[i];
        auto &v = mpx[x];
        int idx = upper_bound(v.begin(), v.end(), y) - v.begin();
        int ans = 0;
        if (idx < v.size()) {
            int kind = id[{x, v[idx]}];
            if (kind == 1) ans = 1;
        }
        idx = lower_bound(v.begin(), v.end(), y) - v.begin() - 1;
        if (idx >= 0) {
            int kind = id[{x, v[idx]}];
            if (kind == 1) ans = 1;
        }

        auto &v1 = mpy[y];
        idx = upper_bound(v1.begin(), v1.end(), x) - v1.begin();
        if (idx < v1.size()) {
            int kind = id[{v1[idx], y}];
            if (kind == 1) ans = 1;
        }
        idx = lower_bound(v1.begin(), v1.end(), x) - v1.begin() - 1;
        if (idx >= 0) {
            int kind = id[{v1[idx], y}];
            if (kind == 1) ans = 1;
        }
        cout << ans;
    }
    cout << endl;
    for (int i = 0; i < n2; i++) {
        auto [x, y] = p2[i];
        auto &v = mpx[x];
        int idx = upper_bound(v.begin(), v.end(), y) - v.begin();
        int ans = 0;
        if (idx < v.size()) {
            int kind = id[{x, v[idx]}];
            if (kind == 0) ans = 1;
        }
        idx = lower_bound(v.begin(), v.end(), y) - v.begin() - 1;
        if (idx >= 0) {
            int kind = id[{x, v[idx]}];
            if (kind == 0) ans = 1;
        }

        auto &v1 = mpy[y];
        idx = upper_bound(v1.begin(), v1.end(), x) - v1.begin();
        if (idx < v1.size()) {
            int kind = id[{v1[idx], y}];
            if (kind == 0) ans = 1;
        }
        idx = lower_bound(v1.begin(), v1.end(), x) - v1.begin() - 1;
        if (idx >= 0) {
            int kind = id[{v1[idx], y}];
            if (kind == 0) ans = 1;
        }
        cout << ans;
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    for(int i = 1; i <= t; i ++ ) {
        solve();
    }

}