#include <bits/stdc++.h>

struct Node {
	int x, y;
	int c, ans, id;
};
Node p[200000 * 2 + 5];

int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%d%d", &p[i].x, &p[i].y), p[i].c = 1, p[i].id = i;
	for (int i = 1; i <= m; i++)
		scanf("%d%d", &p[i + n].x, &p[i + n].y), p[i + n].c = 2, p[i + n].id = i + n;
	std::sort(p + 1, p + 1 + n + m, [](Node a, Node b) {
		return a.x == b.x ? a.y < b.y : a.x < b.x;
	});
	int _l = 0, _r = 0;
	for (int i = 1; i <= n + m; i++) {
		if (i == _r + 1) {
			_l = _r = i;
			while (_r <= n + m && p[i].x == p[_r].x)
				_r++;
			_r--;
		}
		int l = _l, r = _r, mid, ans = -1;
		while (l <= r) {
			mid = (l + r) >> 1;
			if (p[mid].y < p[i].y)
				ans = mid, l = mid + 1;
			else
				r = mid - 1;
		}
		if (ans != -1 && p[ans].y < p[i].y && p[i].c != p[ans].c) {
			p[i].ans = 1;
			continue;
		}
		l = _l;
		r = _r;
		ans = -1;
		while (l <= r) {
			mid = (l + r) >> 1;
			if (p[mid].y > p[i].y)
				ans = mid, r = mid - 1;
			else
				l = mid + 1;
		}
		if (ans != -1 && p[ans].y > p[i].y && p[i].c != p[ans].c) {
			p[i].ans = 1;
		}
	}

	for (int i = 1; i <= n + m; i++)
		std::swap(p[i].x, p[i].y);
	std::sort(p + 1, p + 1 + n + m, [](Node a, Node b) {
		return a.x == b.x ? a.y < b.y : a.x < b.x;
	});
	_l = 0, _r = 0;
	for (int i = 1; i <= n + m; i++) {
		if (i == _r + 1) {
			_l = _r = i;
			while (_r <= n + m && p[i].x == p[_r].x)
				_r++;
			_r--;
		}
		int l = _l, r = _r, mid, ans = -1;
		while (l <= r) {
			mid = (l + r) >> 1;
			if (p[mid].y < p[i].y)
				ans = mid, l = mid + 1;
			else
				r = mid - 1;
		}
		if (ans != -1 && p[ans].y < p[i].y && p[i].c != p[ans].c) {
			p[i].ans = 1;
			continue;
		}
		l = _l;
		r = _r;
		ans = -1;
		while (l <= r) {
			mid = (l + r) >> 1;
			if (p[mid].y > p[i].y)
				ans = mid, r = mid - 1;
			else
				l = mid + 1;
		}
		if (ans != -1 && p[ans].y > p[i].y && p[i].c != p[ans].c) {
			p[i].ans = 1;
		}
	}
	std::sort(p + 1, p + 1 + n + m, [](Node a, Node b) {
		return a.id < b.id;
	});
	for (int i = 1; i <= n; i++)
		putchar('0' + p[i].ans);
	puts("");
	for (int i = 1; i <= m; i++)
		putchar('0' + p[i + n].ans);
	return 0;
}