#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;

mt19937 rng(time(NULL));

const int N=3e5+5;
struct dsu{
	vector<int> par;
	vector<bool> changed;
	vector<pair<int,int>> old;
	int cntComp,cntCompsnap;
	bool activeSnap;
	void reset(int n){
		par.resize(n);
		changed.resize(n);
		iota(all(par),0);
		fill(all(changed),0);
		old.clear();
		cntComp=n;
		activeSnap=0;
	}
	void snapshot(){
		for(auto p:old){
			changed[p.f]=0;
		}
		old.clear();
		cntCompsnap=cntComp;
		activeSnap=1;
	}
	void goToSnapshot(){
		for(auto p:old){
			par[p.f]=p.s;
			changed[p.f]=0;
		}
		old.clear();
		cntComp=cntCompsnap;
	}
	int find(int tr){
		if(tr==par[tr])return tr;
		int d=find(par[tr]);
		if(activeSnap&&d!=par[tr]&&!changed[tr]){
			changed[tr]=1;
			old.pb({tr,par[tr]});
		}
		par[tr]=d;
		return d;
	}
	void merge(int a,int b){
		a=find(a);
		b=find(b);
		if(a==b)return;
		cntComp--;
		if(rng()%2)swap(a,b);
		if(activeSnap&&!changed[a]){
			changed[a]=1;
			old.pb({a,par[a]});
		}
		par[a]=b;
	}
}dsu;
vector<int> dx={1,1,1,0,-1,-1,-1,0},dy={1,0,-1,-1,-1,0,1,1};
int main()
{
	ios;
	int n,m,k;
	cin>>n>>m>>k;
	bool mx=0;
	if(n==-1){
		n=1;
		m=3e5;
		k=m;
		mx=1;
	}
	vector<pair<int,int>> ord;
	int C=550;
	auto inside=[&](int x,int y){
		return x>=0&&x<n&&y>=0&&y<m;
	};
	auto ind=[&](int x,int y){
		return x*m+y;
	};
	auto onBorder=[&](int x,int y){
		return x==0||y==0||x==n-1||y==m-1;
	};
	for(int i=0;i<k;i++){
		int x,y;
		if(mx){
			x=1;
			y=rng()%m+1;
		}
		else
			cin >> x >> y;
		x--;y--;
		ord.pb({x,y});
	}
	vector<vector<bool>> on(n,vector<bool>(m));
	vector<vector<bool>> next(n,vector<bool>(m));
	int cntNext=0,cntNextOld=0;
	vector<pair<pair<int,int>,int>> back;
	auto reset=[&](){
		back.clear();
		cntNext=0;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				next[i][j]=0;
				if(on[i][j]){
					if(onBorder(i,j)){
						next[i][j]=1;
						cntNext++;
					}
					else{
						for(int kk=0;kk<8;kk++){
							int x=i+dx[kk],y=j+dy[kk];
							if(inside(x,y)&&!on[x][y]){
								next[i][j]=1;
								cntNext++;
								break;
							}
						}
					}
				}
			}
		}
	};
	auto snap=[&](){
		back.clear();
		cntNextOld=cntNext;
	};
	auto add=[&](int i,int j){
		if(next[i][j]){
			back.pb({{i,j},1});
			next[i][j]=0;
			cntNext--;
		}
		for(int kk=0;kk<8;kk++){
			int x=i+dx[kk],y=j+dy[kk];
			if(inside(x,y)&&on[x][y]&&!next[x][y]){
				back.pb({{x,y},0});
				next[x][y]=1;
				cntNext++;
			}
		}
	};
	auto bac=[&](){
		reverse(all(back));
		for(auto p:back){
			next[p.f.f][p.f.s]=p.s;
		}
		back.clear();
		cntNext=cntNextOld;
	};
	vector<bool> ok(k,1);
	int cntDo=0;
	for(int i=0;i<k;){
		int ost=min(C,k-i);
		int j=i+ost;
		//printf("%i->%i\n",i,j);
		for(int o=i;o<j;o++){
			int x=ord[o].f,y=ord[o].s;
			on[x][y]=1;
		}
		dsu.reset(n*m+1);
		reset();
		for(int x=0;x<n;x++){
			for(int y=0;y<m;y++){
				if(!on[x][y]){
					if(onBorder(x,y)){
						dsu.merge(ind(x,y),n*m);
					}
					for(int kk=0;kk<4;kk++){
						int xx=x+dx[kk],yy=y+dy[kk];
						if(inside(xx,yy)&&!on[xx][yy]){
							dsu.merge(ind(x,y),ind(xx,yy));
						}
					}
				}
			}
		}
		cntDo++;
		//printf("CntComp: %i\n",dsu.cntComp);
		while(1){
			if(dsu.cntComp-cntNext==1){ // everything is ok
				break;
			}
			dsu.snapshot();
			snap();
			for(int o=j-1;o>=i-1;o--){
				assert(o!=i-1);
				int x=ord[o].f,y=ord[o].s;
				assert(on[x][y]);
				on[x][y]=0;
				add(x,y);
				if(onBorder(x,y)){
					dsu.merge(ind(x,y),n*m);
				}
				for(int kk=0;kk<8;kk++){
					int xx=x+dx[kk],yy=y+dy[kk];
					if(inside(xx,yy)&&!on[xx][yy]){
						dsu.merge(ind(x,y),ind(xx,yy));
					}
				}
				if(dsu.cntComp-cntNext==1){
					ok[o]=0;
					dsu.goToSnapshot();
					bac();
					for(int p=o+1;p<j;p++){
						on[ord[p].f][ord[p].s]=1;
					}
					add(x,y);
					if(onBorder(x,y)){
						dsu.merge(ind(x,y),n*m);
					}
					for(int kk=0;kk<8;kk++){
						int xx=x+dx[kk],yy=y+dy[kk];
						if(inside(xx,yy)&&!on[xx][yy]){
							dsu.merge(ind(x,y),ind(xx,yy));
						}
					}
					break;
				}
			}
		}
		i=j;
	}
	if(mx)
	printf("%i\n",cntDo);
	for(int i=0;i<k;i++){
		printf(ok[i]?"1":"0");
	}
	printf("\n");
	return 0;
}