#include <bits/stdc++.h>
using namespace std;
#define N 205
#define N1 2005
#define N2 150005
int n1,n2,m,ans;bool a[N][N];char a1[N];
int cntE,hd[N1],vs[N1];bool tg1,tg[N1];struct Edge {int v,nxt;}e[N1];
struct Seg {int vl,cnt;vector<int> zL1,zR1,zL2,zR2;}sg[N2];
void addE(int u,int v)
{
	e[++cntE]=(Edge) {v,hd[u]};hd[u]=cntE;
	e[++cntE]=(Edge) {u,hd[v]};hd[v]=cntE;
}
void dfs(int u,int x)
{
	if(vs[u]) return;vs[u]=x;tg1|=tg[u];
	for(int i=hd[u];i;i=e[i].nxt) dfs(e[i].v,x);
}
void pu1(int p,int l1,int r1,int l2,int r2)
{
	int mid=(l1+r1)/2,n1=sg[p*2].cnt,n2=sg[p*2+1].cnt;cntE=sg[p].cnt=0;
	sg[p].vl=sg[p*2].vl+sg[p*2+1].vl-n1-n2;fill(hd+1,hd+n1+n2+1,0);
	fill(vs+1,vs+n1+n2+1,0);fill(tg+1,tg+n1+n2+1,0);
	for(int i=0;i<=r2-l2;++i) if(a[mid][l2+i]==a[mid+1][l2+i])
		addE(sg[p*2].zR1[i],n1+sg[p*2+1].zL1[i]);
	for(int i=0;i<=r2-l2;++i) tg[sg[p*2].zL1[i]]=tg[n1+sg[p*2+1].zR1[i]]=1;
	for(int i=0;i<=mid-l1;++i) tg[sg[p*2].zL2[i]]=tg[sg[p*2].zR2[i]]=1;
	for(int i=0;i<r1-mid;++i) tg[n1+sg[p*2+1].zL2[i]]=tg[n1+sg[p*2+1].zR2[i]]=1;
	for(int i=1;i<=n1+n2;++i) if(!vs[i])
	{tg1=0;++sg[p].vl;dfs(i,++sg[p].cnt);if(!tg1) --sg[p].cnt;}
	for(int i=0;i<=r2-l2;++i)
		sg[p].zL1[i]=vs[sg[p*2].zL1[i]],sg[p].zR1[i]=vs[n1+sg[p*2+1].zR1[i]];
	for(int i=0;i<=mid-l1;++i)
		sg[p].zL2[i]=vs[sg[p*2].zL2[i]],sg[p].zR2[i]=vs[sg[p*2].zR2[i]];
	for(int i=0;i<r1-mid;++i)
		sg[p].zL2[mid-l1+i+1]=vs[n1+sg[p*2+1].zL2[i]],
		sg[p].zR2[mid-l1+i+1]=vs[n1+sg[p*2+1].zR2[i]];
}
void pu2(int p,int l1,int r1,int l2,int r2)
{
	int mid=(l2+r2)/2,n1=sg[p*2].cnt,n2=sg[p*2+1].cnt;cntE=sg[p].cnt=0;
	sg[p].vl=sg[p*2].vl+sg[p*2+1].vl-n1-n2;fill(hd+1,hd+n1+n2+1,0);
	fill(vs+1,vs+n1+n2+1,0);fill(tg+1,tg+n1+n2+1,0);
	for(int i=0;i<=r1-l1;++i) if(a[l1+i][mid]==a[l1+i][mid+1])
		addE(sg[p*2].zR2[i],n1+sg[p*2+1].zL2[i]);
	for(int i=0;i<=r1-l1;++i) tg[sg[p*2].zL2[i]]=tg[n1+sg[p*2+1].zR2[i]]=1;
	for(int i=0;i<=mid-l2;++i) tg[sg[p*2].zL1[i]]=tg[sg[p*2].zR1[i]]=1;
	for(int i=0;i<r2-mid;++i) tg[n1+sg[p*2+1].zL1[i]]=tg[n1+sg[p*2+1].zR1[i]]=1;
	for(int i=1;i<=n1+n2;++i) if(!vs[i])
	{tg1=0;++sg[p].vl;dfs(i,++sg[p].cnt);if(!tg1) --sg[p].cnt;}
	for(int i=0;i<=r1-l1;++i)
		sg[p].zL2[i]=vs[sg[p*2].zL2[i]],sg[p].zR2[i]=vs[n1+sg[p*2+1].zR2[i]];
	for(int i=0;i<=mid-l2;++i)
		sg[p].zL1[i]=vs[sg[p*2].zL1[i]],sg[p].zR1[i]=vs[sg[p*2].zR1[i]];
	for(int i=0;i<r2-mid;++i)
		sg[p].zL1[mid-l2+i+1]=vs[n1+sg[p*2+1].zL1[i]],
		sg[p].zR1[mid-l2+i+1]=vs[n1+sg[p*2+1].zR1[i]];
}
void build(int p,int l1,int r1,int l2,int r2)
{
	sg[p].zL1.resize(r2-l2+1);sg[p].zR1.resize(r2-l2+1);
	sg[p].zL2.resize(r1-l1+1);sg[p].zR2.resize(r1-l1+1);
	if(l1==r1 && l2==r2) {sg[p]=(Seg) {1,1,{1},{1},{1},{1}};return;}
	if(r1-l1>r2-l2)
	{
		int mid=(l1+r1)/2;build(p*2,l1,mid,l2,r2);
		build(p*2+1,mid+1,r1,l2,r2);pu1(p,l1,r1,l2,r2);
	}
	else
	{
		int mid=(l2+r2)/2;build(p*2,l1,r1,l2,mid);
		build(p*2+1,l1,r1,mid+1,r2);pu2(p,l1,r1,l2,r2);
	}
}
void upd(int p,int l1,int r1,int l2,int r2,int x1,int x2)
{
	if(l1==r1 && l2==r2) return;
	if(r1-l1>r2-l2)
	{
		int mid=(l1+r1)/2;
		if(x1<=mid) upd(p*2,l1,mid,l2,r2,x1,x2);
		else upd(p*2+1,mid+1,r1,l2,r2,x1,x2);pu1(p,l1,r1,l2,r2);
	}
	else
	{
		int mid=(l2+r2)/2;
		if(x2<=mid) upd(p*2,l1,r1,l2,mid,x1,x2);
		else upd(p*2+1,l1,r1,mid+1,r2,x1,x2);pu2(p,l1,r1,l2,r2);
	}
}
int main()
{
	scanf("%d %d %d",&n1,&n2,&m);
	for(int i=1;i<=n1;++i)
	{scanf("%s",a1+1);for(int j=1;j<=n2;++j) a[i][j]=a1[j]-48;}
	build(1,1,n1,1,n2);ans=sg[1].vl;
	for(int i=1,x1,x2;i<=m;++i)
	{
		scanf("%d %d",&x1,&x2);x1^=ans;x2^=ans;a[x1][x2]^=1;
		upd(1,1,n1,1,n2,x1,x2);printf("%d\n",ans=sg[1].vl);
	}return 0;
}