#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10,fx[4]={1,0,-1,0},fy[4]={0,1,0,-1};
int n,m,k,fa[N],V=0,E=0,C=0,F=1,ans[N],p[N];
int id(int x,int y){return (x-1)*m+y;}
int getfa(int x){return x==fa[x]?x:(fa[x]=getfa(fa[x]));}
bool chk(int x,int y)
{
	for(int i=-1;i<=0;i++)
		for(int j=-1;j<=0;j++)
			if(!p[id(x+i,y+j)]) return 0;
	return 1;
}
int main()
{
	scanf("%d%d%d",&n,&m,&k);
	n+=2,m+=2;
	for(int i=1,x,y;i<=k;i++)
	{
		scanf("%d%d",&x,&y),x++,y++;
		vector<int> v{id(x,y)};
		for(int j=0;j<4;j++)
		{
			int X=x+fx[j],Y=y+fy[j];
			if(p[id(X,Y)]) v.push_back(getfa(id(X,Y)));
			v.push_back(id(X,Y));
		}
		int e=v.size()-1,f=0;
		p[id(x,y)]=1;
		sort(v.begin(),v.end());
		v.erase(unique(v.begin(),v.end()),v.end());
		int c=2-(int)v.size();
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++)
				f+=chk(x+i,y+j);
		if(c==1-e+f)
		{
			C+=c,V++,F+=f,E+=e;
			ans[i]=1;
			for(int i=1;i<(int)v.size();i++)
				fa[getfa(v[i])]=getfa(v[0]);
		}
		else p[id(x,y)]=0;
	}
	for(int i=1;i<=k;i++) putchar(ans[i]+'0');
	puts("");
}