#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m,k;
	cin>>n>>m>>k;
	vector<vector<int>> a(n+5,vector<int>(m+5));
	vector<int> pa(n*m+5);
	int C=0,V=0,E=0,S=0;
	auto hs=[&](int x,int y){return (x-1)*m+y;};
	auto inb=[&](int x,int y){return 1<=x and x<=n and 1<=y and y<=m;};
	function<int(int)> find=[&](int x){return pa[x]?pa[x]=find(pa[x]):x;};
	vector<int> ans(k+5);
	for(int tt=1;tt<=k;tt++)
	{
		int x,y;
		cin>>x>>y;
		a[x][y]=1;
		int tC=C,tV=V,tE=E,tS=S;
		tC++;
		vector<int> pC;
		tV++;
		if(inb(x-1,y) and a[x-1][y])tE++,pC.emplace_back(find(hs(x-1,y)));
		if(inb(x,y-1) and a[x][y-1])tE++,pC.emplace_back(find(hs(x,y-1)));
		if(inb(x+1,y) and a[x+1][y])tE++,pC.emplace_back(find(hs(x+1,y)));
		if(inb(x,y+1) and a[x][y+1])tE++,pC.emplace_back(find(hs(x,y+1)));
		for(int i=max(x-1,1);i+1<=min(x+1,n);i++)
			for(int j=max(y-1,1);j+1<=min(y+1,m);j++)
			{
				if(a[i][j] and a[i+1][j] and a[i][j+1] and a[i+1][j+1])
					tS++;
			}
		sort(pC.begin(),pC.end());
		pC.erase(unique(pC.begin(),pC.end()),pC.end());
		tC-=(int)pC.size();
//		cerr<<"!! "<<tE<<' '<<tV<<' '<<tS<<' '<<tC<<' '<<tE-tV-tS+tC<<endl;
		if(tE-tV-tS+tC==0)
		{
			ans[tt]=1;
			E=tE;V=tV;S=tS;C=tC;
			auto merge=[&](int u,int v)
			{
				int pu=find(u),pv=find(v);
				if(pu!=pv)pa[pv]=pu;
			};
			if(inb(x-1,y) and a[x-1][y])merge(hs(x-1,y),hs(x,y));
			if(inb(x,y-1) and a[x][y-1])merge(hs(x,y-1),hs(x,y));
			if(inb(x+1,y) and a[x+1][y])merge(hs(x+1,y),hs(x,y));
			if(inb(x,y+1) and a[x][y+1])merge(hs(x,y+1),hs(x,y));
		}
		else
		{
			a[x][y]=0;
		}
	}
	for(int i=1;i<=k;i++)
		cout<<ans[i];
	return 0;
}