#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=(k);++i)
#define drp(i,j,k) for(int i=j;i>=(k);--i)
#define mp std::make_pair
#define MAXN 1000005
typedef long long ll;
typedef std::pair<int,int> pii;
const int dx[8]={1,-1,0,0,1,1,-1,-1};
const int dy[8]={0,0,1,-1,1,-1,1,-1};
int n,m,k,cnt,a[MAXN],anc[MAXN],size[MAXN];
std::string ans;
pii seq[MAXN];
std::vector<int> tim[MAXN];
inline int code(int x,int y){
	if(x<1||y<1||x>n||y>m) return n*m+1;
	return (x-1)*m+y;
}
inline int find(int x){
	if(anc[x]==x) return x;
	return find(anc[x]);
}
namespace sgt{
	struct node{
		node *ls,*rs;
		std::vector<pii> vec;
	}pool[MAXN<<1],*pos=pool,*root;
	#define mid (l+r>>1)
	#define lson tree->ls,l,mid
	#define rson tree->rs,mid+1,r
	inline void build(node *&tree,int l,int r){
		tree=++pos;
		if(l!=r) build(lson),build(rson);
	}
	inline void ins(node *tree,int l,int r,int x,int y,pii e){
//		if(e==mp(8,11)&&x<=l&&r<=y) std::cerr<<"ins "<<l<<' '<<r<<'\n';
		if(x<=l&&r<=y) return tree->vec.push_back(e),void();
		if(x<=mid) ins(lson,x,y,e);
		if(y>mid) ins(rson,x,y,e);
	}
	inline void solve(node *tree,int l,int r){
		std::vector<pii> tmp;
//		std::cerr<<"solve "<<l<<' '<<r<<'\n';
		for(auto x:tree->vec){
			int fx=find(x.first),fy=find(x.second);
//			std::cerr<<"qwq "<<x.first<<' '<<x.second<<' '<<fx<<' '<<fy<<'\n';
			if(fx==fy) continue;
//			std::cerr<<"qwq "<<x.first<<' '<<x.second<<'\n';
			if(size[fx]>size[fy]) std::swap(fx,fy);
			anc[fx]=fy,size[fy]+=size[fx];
			tmp.emplace_back(fx,fy);
		}
//		rep(i,1,n) rep(j,1,m) std::cerr<<find(code(i,j))<<" \n"[j==m];
//		std::cerr<<find(n*m+1)<<'\n';
		if(l==r){
		    rep(i,1,n) rep(j,1,m) std::cerr<<a[code(i,j)]<<" \n"[j==m];
		    std::cerr<<'\n';
//			std::cerr<<cnt<<' '<<size[find(n*m+1)]<<'\n';
		    int u=code(seq[l].first,seq[l].second);
			if(size[find(n*m+1)]==n*m-cnt) ++cnt,a[u]=1,ans+='1';
			else{
				ans+='0';
			    rep(i,0,7){
				    int nx=seq[l].first+dx[i],ny=seq[l].second+dy[i];
				    int v=code(nx,ny);
				    if(a[v]) continue;
				    else{
					    int t1=*std::upper_bound(tim[u].begin(),tim[u].end(),l);
					    int t2=*std::upper_bound(tim[v].begin(),tim[v].end(),l);
					    if(l+1<=std::min(t1,t2)-1) ins(root,1,k,l+1,std::min(t1,t2)-1,mp(u,v));
				    }
			    }
		    }
		    std::cerr<<"QWQ "<<ans.back()<<'\n';
		}
		else solve(lson),solve(rson);
		std::reverse(tmp.begin(),tmp.end());
		for(auto x:tmp) anc[x.first]=x.first,size[x.second]-=size[x.first];
	}
}
using namespace sgt;
int main(){
	std::ios::sync_with_stdio(0);
	std::cin.tie(0),std::cout.tie(0);
	std::cin>>n>>m>>k;
	rep(i,1,k){
		std::cin>>seq[i].first>>seq[i].second;
		tim[code(seq[i].first,seq[i].second)].push_back(i);
	}
	build(root,1,k);
	rep(i,1,n*m+1) anc[i]=i,size[i]=1,tim[i].push_back(k+1);
//	rep(i,1,n) rep(j,1,m) std::cerr<<i<<' '<<j<<' '<<code(i,j)<<'\n';
	rep(i,1,n) rep(j,1,m){
		int u=code(i,j);
		std::vector<int> tmp;
		if(i==1||j==1||i==n||j==m) tmp.push_back(n*m+1);
		if(i!=n) tmp.push_back(code(i+1,j));
		if(j!=m) tmp.push_back(code(i,j+1));
		if(i!=n&&j!=1) tmp.push_back(code(i+1,j-1));
		if(i!=n&&j!=m) tmp.push_back(code(i+1,j+1));
		for(auto v:tmp){
			int t1=tim[u][0],t2=tim[v][0];
//			std::cerr<<u<<' '<<v<<' '<<std::min(t1,t2)<<'\n';
			if(std::min(t1,t2)>1) ins(root,1,k,1,std::min(t1,t2)-1,mp(u,v));
		}
    }
//	std::cerr<<"QAQ\n";
	solve(root,1,k);
	std::cout<<ans<<'\n';
}