#include<bits/stdc++.h>
using namespace std;
const int MAXN=1005;
int n,m,ans=0;
char mmp[MAXN][MAXN];
int ask[MAXN][MAXN];
int mp[MAXN][MAXN];
bool mp2[MAXN][MAXN];
int mx[5]={0,1,0,-1,0};
int my[5]={0,0,-1,0,1};
void dfs(int x,int y){
	ans++;
	mp2[x][y]=1;
	for(int i=1;i<=4;i++){
		if((!x+mx[i])||(!y+my[i])||(x+mx[i]>n)||(y+my[i]>n))
			continue;
		if(mp2[x+mx[i]][y+my[i]]) continue;
		if(mp[x+mx[i]][y+my[i]]==mp[x][y]) continue;
		dfs(x+mx[i],y+my[i]);
	}
}
int main(){
	char c;
	scanf("%d%d",&n,&m);
	c=getchar();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>mmp[i][j];
			mp[i][j]=int(mmp[i][j]-'0');
		}
	}
    /*for(int t=1;t<=n;t++){
        for(int p=1;p<=n;p++)
            printf("%d",mp[t][p]);
        printf("\n");
    }*/
	for(int i=1;i<=m;i++){
		int x,y;
		ans=0;
		memset(mp2,0,sizeof(mp2));
		scanf("%d%d",&x,&y);
		dfs(x,y);
		printf("%d\n",ans);
	}
	return 0;
}