#include<bits/stdc++.h>
using namespace std;
int n,m,qn;
inline int id(int i,int j){
   return (i-1)*m+j;
}
inline pair<int,int>pos(int u){
   return{(u-1)/m+1,(u-1)%m+1};
}
inline bool valid(int i,int j){
   return 1<=i&&i<=n&&1<=j&&j<=m;
}
inline int id2(int i,int j){return valid(i,j)?id(i,j):n*m+1;}
inline array<pair<int,int>,4>adj(int i,int j){
   return{{{i-1,j},{i,j-1},{i+1,j},{i,j+1}}};
}
namespace dsu{
int fa[300010],sz[300010],stk[300010],tp,tot;
void init(){
   for(int i=1;i<=n*m+1;i++)sz[i]=1;
   tot=n*m+1;
}
int fr(int u){return fa[u]?fr(fa[u]):u;}
inline bool merge(int x,int y){
   if((x=fr(x))==(y=fr(y)))return false;
   if(sz[x]>sz[y])swap(x,y);
   fa[x]=y,sz[y]+=sz[x],stk[++tp]=x,tot--;
   return true;
}
void clear(int T){
   while(tp>T){
      int u=stk[tp--];
      sz[fa[u]]-=sz[u],fa[u]=0,tot++;
   }
}
}
vector<int>node[300010<<2];
bool active[300010];
int q[300010];
void put(int u,int l,int r,int L,int R,int x){
   if(L<=l&&r<=R)return node[u].push_back(x),void();
   int mid=l+r>>1;
   if(L<=mid)put(u<<1,l,mid,L,R,x);
   if(R>mid)put(u<<1|1,mid+1,r,L,R,x);
}
void solve(int u,int l,int r){
   int cur=dsu::tp;
   for(int x:node[u]){
      active[x]=true;
      auto X=pos(x);
      for(auto Y:adj(X.first,X.second)){
         int y=id2(Y.first,Y.second);
         if(active[y])dsu::merge(x,y);
      }
   }
   if(l==r){
      auto X=pos(q[l]);
      bool flag=true;
      for(auto Y:adj(X.first,X.second))if(valid(Y.first,Y.second)){
         int t0=dsu::tp,y=id(Y.first,Y.second);
         if(active[y]){if(dsu::tot>2)flag=false;}
         else{
            for(auto Z:adj(Y.first,Y.second)){
               int z=id2(Z.first,Z.second);
               if(active[z])dsu::merge(y,z);
            }
            if(dsu::tot>1)flag=false;
         }
         dsu::clear(t0);
      }
      if(flag)dsu::tot--,putchar('1');
      else{
         putchar('0');
         if(l<qn)put(1,1,qn,l+1,qn,q[l]);
      }
   }
   else{
      int mid=l+r>>1;
      solve(u<<1,l,mid);
      solve(u<<1|1,mid+1,r);
   }
   dsu::clear(cur);
   for(int x:node[u])active[x]=false;
}
int main(){
   scanf("%d%d%d",&n,&m,&qn);
   dsu::init();
   vector<int>vis(n*m+2);
   for(int i=1,x,y;i<=qn;i++){
      scanf("%d%d",&x,&y),q[i]=id(x,y);
      vis[q[i]]=1;
      if(i>1)put(1,1,qn,1,i-1,q[i]);
   }
   for(int i=1;i<=n*m;i++)if(!vis[i])node[1].push_back(i);
   active[n*m+1]=true;
   solve(1,1,qn);
   return 0;
}