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

typedef pair <int, int> pii;

const int N = 6e5 + 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};

int sx[N], sy[N], w[N];
int n, m, k;

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

pii edg[N];
int ch[N][2], rev[N], fa[N], st[N], mn[N], pos[N], val[N], rub[N];
int tot, top, len;

inline int newNode() {
	if (len) return rub[len--];
	return ++tot;
}

void update(int u) {
	mn[u] = val[u]; pos[u] = u;
	for (int i = 0; i <= 1; i++) {
		if (ch[u][i] && mn[ch[u][i]] < mn[u]) {
			mn[u] = mn[ch[u][i]];
			pos[u] = pos[ch[u][i]];
		}
	}
}

inline int isroot(int u) {
	return ch[fa[u]][0] != u && ch[fa[u]][1] != u;
}

inline int get(int u) {
	return ch[fa[u]][1] == u;
}

void add_rev(int u) {
	rev[u] ^= 1;
	swap(ch[u][0], ch[u][1]);
}

void pushdown(int u) {
	if (rev[u]) {
		if (ch[u][0]) add_rev(ch[u][0]);
		if (ch[u][1]) add_rev(ch[u][1]);
		rev[u] = 0;
	}
}

void rotate(int u) {
    int old = fa[u], oldd = fa[old], k = get(u);
    if (!isroot(old)) { ch[oldd][get(old)] = u; } fa[u] = oldd;
    ch[old][k] = ch[u][k ^ 1]; fa[ch[u][k ^ 1]] = old;
    fa[old] = u; ch[u][k ^ 1] = old;
    update(old); update(u);
}

void splay(int u) {
    st[top = 1] = u;
    for (int i = u; !isroot(i); i = fa[i]) st[++top] = fa[i];
    for (int i = top; i >= 1; i--) pushdown(st[i]);
    for (; !isroot(u); rotate(u)) if (!isroot(fa[u])) rotate(get(u) == get(fa[u]) ? fa[u] : u);
}

void access(int u) {
    for (int i = 0; u; i = u, u = fa[u]) {
        splay(u);
        ch[u][1] = i;
        update(u);
    }
}

void makeroot(int u) {
    access(u);
    splay(u);
    add_rev(u);
}

void link(int u, int v) {
	// fprintf(stderr, "link %d %d\n", u, v);
    makeroot(u);
    fa[u] = v;
}

void cut(int u, int v) {
	// fprintf(stderr, "cut %d %d\n", u, v);
    makeroot(u);
    access(v);
    splay(v);
    fa[u] = ch[v][0] = 0;
    update(v);
}

pii query(int u, int v) {
    makeroot(u);
    access(v);
    splay(v);
    return make_pair(mn[v], pos[v]);
}

struct edge {
	int u, v, w;
	edge (int a = 0, int b = 0, int c = 0) : u(a), v(b), w(c) {}
	bool operator < (const edge A) const { return w > A.w; }
} e[N * 8];

int f[N], elen;

int find(int x) {
	return f[x] == x ? x : f[x] = find(f[x]);
}

priority_queue <pii> Q;
int dis[N], vis[N], ww[N];
int brute() {
	memset(dis, 0, sizeof(dis));
	memset(vis, 0, sizeof(vis));
	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)] = ww[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], ww[v])) {
					dis[v] = min(dis[u], ww[v]);
					Q.push(make_pair(dis[v], v));
				}
			}
		}
	}
	int ans = k;
	for (int i = 1; i <= n * m; i++) {
		if (dis[i] < ww[i]) {
			ans = min(ans, dis[i]);
		}
	}
	return ans == k;
}

int ret[N];

int main() {
	// freopen("a.in", "r", stdin);
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 1; i <= n * m; i++) w[i] = ww[i] = k;
	for (int i = 1; i <= k; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		sx[i] = x; sy[i] = y;
		w[s(x, y)] = i - 1;
	}
	/*
	for (int i = 1; i <= k; i++) {
		ww[s(sx[i], sy[i])] = i - 1;
		int ans = brute(); ret[i] = ans;
		printf("%d", ans);
		if (!ans) ww[s(sx[i], sy[i])] = k;
	}
	printf("\n");
	*/
	for (int i = 1; i <= n * m + 1; i++) f[i] = i;
	tot = n * m + 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int u = s(i, j), ok = 0;
			for (int d = 0; d < 8; d++) {
				int x = i + dx[d];
				int y = j + dy[d];
				if (x < 1 || y < 1 || x > n || y > m) {
					ok = 1;
				} else {
					int v = s(x, y);
					if (u < v) {
						e[++elen] = edge(u, v, min(w[u], w[v]));
					}
				}
			}
			if (ok) {
				e[++elen] = edge(n * m + 1, u, w[u]);
			}
		}
	}
	for (int i = 1; i <= n * m + 1; i++) {
		mn[i] = val[i] = 1e9;
		pos[i] = i;
	}
	sort(e + 1, e + elen + 1);
	for (int i = 1; i <= elen; i++) {
		int x = find(e[i].u), y = find(e[i].v);
		if (x != y) {
			f[x] = y;
			int tmp = newNode();
			edg[tmp] = make_pair(e[i].u, e[i].v);
			mn[tmp] = val[tmp] = e[i].w; pos[tmp] = tmp;
			link(e[i].u, tmp);
			link(e[i].v, tmp);
		}
	}
	for (int i = 1; i <= k; i++) {
		int ans = 1;
		for (int d = 0; d < 8; d++) {
			int x = sx[i] + dx[d];
			int y = sy[i] + dy[d];
			if (x >= 1 && y >= 1 && x <= n && y <= m && w[s(x, y)] >= i) {
				// fprintf(stderr, "i = %d, x = %d, y = %d, val = %d\n", i, x, y, query(s(x, y), n * m + 1).first);
				int tmp = query(s(x, y), n * m + 1).first;
				assert(tmp >= i - 1);
				if (tmp <= i - 1) {
					ans = 0;
					break;
				}
			}
		}
		printf("%d", ans);
		if (!ans) {
			int u = s(sx[i], sy[i]);
			w[u] = k;
			int ok = 0;
			for (int d = 0; d < 8; d++) {
				int x = sx[i] + dx[d];
				int y = sy[i] + dy[d];
				if (x >= 1 && y >= 1 && x <= n && y <= m) {
					if (w[s(x, y)] >= i || 1) {
						int v = s(x, y);
						pii t = query(u, v);
						if (t.first < w[v]) {
							int pos = t.second;
							cut(pos, edg[pos].first);
							cut(pos, edg[pos].second);
							edg[pos] = make_pair(u, v);
							mn[pos] = val[pos] = w[v];
							link(u, pos); link(v, pos);
						}
					}
				} else ok = 1;
			}
			if (ok) {
				int v = n * m + 1;
				pii t = query(u, v);
				if (t.first < k) {
					int pos = t.second;
					cut(pos, edg[pos].first);
					cut(pos, edg[pos].second);
					edg[pos] = make_pair(u, v);
					mn[pos] = val[pos] = k;
					link(u, pos); link(v, pos);
				}
			}
		}
		// assert(ans == ret[i]);
	}
	printf("\n");
	return 0;
}