#include <bits/stdc++.h>
#define N 300011
#define ID(i,j) (((i)-1)*m+(j))
#define pii pair<int,int>
#define s1 first
#define s2 second
using namespace std;
int n,m,k;
vector<pair<int*,int> > v;
int fa[N],siz[N];
int C,cnt0;
int get(int a){return fa[a]==a?a:get(fa[a]);}
void merge(int a,int b)
{
	a=get(a);b=get(b);
	if(a==b)return;
	++C;//printf("merge(%d,%d)\n",a,b);
	if(siz[a]<siz[b])swap(a,b);
	v.push_back({siz+a,siz[a]});
	siz[a]+=siz[b];
	v.push_back({fa+b,fa[b]});
	fa[b]=a;
}
vector<pii > ve[N*4];
void ins(int l,int r,int a,int b,int L,int R,int x)
{//printf("ins([%d,%d],%d-%d,[%d,%d],%d)\n",l,r,a,b,L,R,x);
	if(l>r)return;
	if(l<=L&&R<=r){ve[x].push_back({a,b});return;}
	if(l<=L+R>>1)ins(l,r,a,b,L,L+R>>1,x<<1);if(r>L+R>>1)ins(l,r,a,b,(L+R>>1)+1,R,x<<1|1);
}
bool a[N];
bool check(int x,int y)
{
	for(int _=0;_<3;++_)for(int __=0;__<3;++__)if(!a[ID(x+_,y+__)])return 0;return 1;
}
int qx[N],qy[N];
int dxy[8][2]={{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1},{1,0},{1,1}};
int tim[N],ans[N];
void dfs(int L,int R,int x)
{//printf("-----------------------dfs([%d,%d],%d) C:%d\n",L,R,x,C);
	int tmdn=v.size(),tC=C;//printf("v.size():%d\n",(int)v.size());
	for(pii y:ve[x])merge(y.s1,y.s2);
	ve[x].clear();ve[x].shrink_to_fit();
	if(L==R)
	{//printf("-----------[%d,%d]\n",L,R);
		// printf("C:%d cnt0:%d\n",C,cnt0);
		// printf("get0:%d\n",get(0));
		// for(int i=1;i<=n;++i)
		// {
		// 	for(int j=1;j<=m;++j)printf("%d ",get(ID(i,j)));putchar(10);
		// }
		bool ok=1;
		a[ID(qx[L],qy[L])]=1;
		if(C!=(cnt0-1)-1)ok=0;
		else
		{
			for(int _=0;_<3&&qx[L]-_>0;++_)
			{
				for(int __=0;__<3&&qy[L]-__>0;++__)if(check(qx[L]-_,qy[L]-__)){ok=0;break;}
				if(!ok)break;
			}
		}
		ans[L]=ok;
		if(!ok)
		{
			a[ID(qx[L],qy[L])]=0;
			for(int _=0;_<8;++_)
			{
				int nx=qx[L]+dxy[_][0],ny=qy[L]+dxy[_][1];
				int idx=0;
				if(nx<=0||nx>n||ny<=0||ny>m)idx=0;
				else if(a[ID(nx,ny)])continue;
				else idx=ID(nx,ny);
				if(tim[idx]>L)ins(L+1,tim[idx]-1,ID(qx[L],qy[L]),idx,1,k,1);
				else ins(L+1,k,ID(qx[L],qy[L]),idx,1,k,1);
			}
		}
		else --cnt0,a[ID(qx[L],qy[L])]=1;
		while(tmdn<v.size())*v.back().s1=v.back().s2,v.pop_back();C=tC;//printf("new C:%d\n",C);
		return;
	}//printf("ntbom\n");
	dfs(L,L+R>>1,x<<1);
	dfs((L+R>>1)+1,R,x<<1|1);//printf("tv.size():%d tmdn:%d\n",(int)v.size());
	while(tmdn<v.size())*v.back().s1=v.back().s2,v.pop_back();C=tC;
		// for(int i=1;i<=n;++i)
		// {
		// 	for(int j=1;j<=m;++j)printf("%d ",get(ID(i,j)));putchar(10);
		// }
}
int main()
{
	scanf("%d%d%d",&n,&m,&k);cnt0=n*m+1;
	for(int i=0;i<=n*m;++i)fa[i]=i,siz[i]=1;
	for(int i=1;i<=k;++i)scanf("%d%d",qx+i,qy+i),tim[ID(qx[i],qy[i])]=i;
	for(int i=0;i<=n*m;++i)if(!tim[i])tim[i]=k+1;
	// printf("tim0:%d\n",tim[0]);
	// printf("tim:\n");
	// for(int i=1;i<=n;++i){for(int j=1;j<=m;++j)printf("%d ",tim[ID(i,j)]);putchar(10);}
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			for(int _=0;_<8;++_)
			{
				int nx=i+dxy[_][0],ny=j+dxy[_][1];
				int idx=0;
				if(nx<=0||nx>n||ny<=0||ny>m)idx=0;
				else if(a[ID(nx,ny)])continue;
				else idx=ID(nx,ny);
				if(idx&&_>=4)continue;
				// printf("i:%d j:%d nx:%d ny:%d idx:%d tim:[%d,%d]\n",i,j,nx,ny,idx,1,min(tim[idx],tim[ID(i,j)])-1);
				ins(1,min(tim[idx],tim[ID(i,j)])-1,ID(i,j),idx,1,k,1);
			}
		}
	}
	dfs(1,k,1);
	for(int i=1;i<=k;++i)putchar(ans[i]+'0');putchar(10);
}