#include<bits/stdc++.h>
using namespace std;
int n,m,x[1000],y[1000],ans,vis[1000][1000];
const int dx[]={-1,1,0,0},dy[]={0,0,-1,1};
char mapp[1000][1000];
void dfs(int x,int y)
{
	int newx,newy;
	for(int i=0;i<4;i++)
	{
		newx=x+dx[i];
		newy=y+dy[i];
		if(newx<=0||newx>n||newy<=0||newy>n)continue;
		if(mapp[x][y]==mapp[newx][newy])continue;
		if(vis[newx][newy])continue;
		vis[newx][newy]=1;
		ans++;
		dfs(newx,newy);
	}
	return;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)cin>>mapp[i][j];
	for(int i=1;i<=m;i++)cin>>x[i]>>y[i];
	for(int i=1;i<=m;i++)
	{
		ans=1;
		memset(vis,0,sizeof(vis));
		vis[x[i]][y[i]]=1;
		dfs(x[i],y[i]);
		cout<<ans<<'\n';
	}
	return 0;
}