#include<bits/stdc++.h>
using namespace std;
char pic[1005][1005];
int a[100005];
int now;
int ma[1005][1005];
int n,m,ans;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void dfs(int x,int y){
	for(int i=0;i<4;i++){
		int xx=x+dx[i],yy=y+dy[i];
		if(xx>0 and xx<=n and yy>0 and yy<=n and pic[xx][yy]!=pic[x][y] and ma[xx][yy]==0){
			ma[xx][yy]=now;
			ans++;
			dfs(xx,yy);
		}
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			cin>>pic[i][j];
	now=1;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(ma[i][j]==0){
				ans=1;
				ma[i][j]=now;
				dfs(i,j);
				a[now]=ans;
				now++;
			}
		}
	}
	while(m--){
		int x,y;
		cin>>x>>y;
		cout<<a[ma[x][y]]<<endl;
	}
}