#include <bits/stdc++.h>
using namespace std;

typedef pair <int, int> pii;

const int N = 3e5 + 5;
const int dx[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy[8] = {1, 0, -1, 1, -1, 1, 0, -1};

priority_queue <pii> Q;
int dis[N], vis[N], w[N];
int n, m, k;

inline int s(int x, int y) {
	return (x - 1) * m + y;
}

int main() {
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 1; i <= n * m; i++) w[i] = k;
	for (int i = 1; i <= k; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		w[s(x, y)] = i - 1;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int ok = 0;
			for (int d = 0; d < 8; d++) {
				int x = i + dx[d], y = j + dy[d];
				if (x < 1 || y < 1 || x > n || y > m) {
					ok = 1;
					break;
				}
			}
			if (ok) {
				dis[s(i, j)] = w[s(i, j)];
				Q.push(make_pair(dis[s(i, j)], s(i, j)));
			}
		}
	}
	while (!Q.empty()) {
		int u = Q.top().second; Q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		int x = (u - 1) / m + 1;
		int y = (u - 1) % m + 1;
		for (int d = 0; d < 8; d++) {
			int xx = x + dx[d];
			int yy = y + dy[d];
			if (xx >= 1 && yy >= 1 && xx <= n && yy <= m) {
				int v = s(xx, yy);
				if (dis[v] < min(dis[u], w[v])) {
					dis[v] = min(dis[u], w[v]);
					Q.push(make_pair(dis[v], v));
				}
			}
		}
	}
	int ans = k;
	for (int i = 1; i <= n * m; i++) {
		if (dis[i] < w[i]) {
			ans = min(ans, dis[i]);
		}
	}
	for (int i = 1; i <= ans; i++) printf("1");
	for (int i = ans + 1; i <= k; i++) printf("0");
	printf("\n");
	return 0;
}