#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N = 1e6 + 5;
int n, m, q;
bool vis[N];
int V, E, F, C;
int fa[N]; int getfa(int x){return x == fa[x] ? x : fa[x] = getfa(fa[x]);}
int getid(int x, int y){
	return x * (m + 2) + y;
}
void update(int x, int y, int k){
	V += k * vis[getid(x, y)];
	E += k * (vis[getid(x, y)] && vis[getid(x - 1, y)]);
	E += k * (vis[getid(x, y)] && vis[getid(x, y - 1)]);
	E += k * (vis[getid(x, y)] && vis[getid(x + 1, y)]);
	E += k * (vis[getid(x, y)] && vis[getid(x, y + 1)]);
	int p[9] = {getid(x - 1, y - 1), getid(x - 1, y), getid(x - 1, y + 1), getid(x, y - 1), getid(x, y), getid(x, y + 1), getid(x + 1, y - 1), getid(x + 1, y), getid(x + 1, y + 1)};
	for (int i = 0; i < 9; i++) p[i] = vis[p[i]];
	F += k * p[0] * p[1] * p[3] * p[4];
	F += k * p[1] * p[2] * p[4] * p[5];
	F += k * p[3] * p[4] * p[6] * p[7];
	F += k * p[4] * p[5] * p[7] * p[8];
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	freopen("in.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
	cin >> n >> m >> q;
	for (int i = 0; i < (n + 2) * (m + 2); i++) fa[i] = i;
	while (q--){
		int x, y;
		cin >> x >> y;
		if (vis[getid(x, y)]){
			putchar('1');
			continue;
		}
		update(x, y, -1);
		vis[getid(x, y)] = 1;
		C++;
		update(x, y, 1);
		int p[5] = {getid(x - 1, y), getid(x, y - 1), getid(x + 1, y), getid(x, y + 1), getid(x, y)};
		set<int> st;
		for (int id : p)
			if (vis[id])
				st.insert(getfa(id));
		if (V - E + F != C - (int)st.size() + 1){
			putchar('0');
			update(x, y, -1);
			vis[getid(x, y)] = 0;
			C--;
			update(x, y, 1);
		}else{
			putchar('1');
			C += 1 - (int)st.size();
			for (int id : st)
				fa[getfa(id)] = getfa(getid(x, y));
		}
	}
	return 0;
}