#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<cmath>
#include<map>
#include<algorithm>
#define QWQ puts("QWQ");
#define ll long long
#define MAXN 1001
using namespace std;
ll xx,yy,ans,n,m,v[MAXN][MAXN];
ll dx[4]={0,-1,1,0};
ll dy[4]={1,0,0,-1};
string a[MAXN];
void dfs(int idx,int idy,int s){
    ans++;
    for(int i=0;i<4;i++){
        ll x=idx+dx[i];
        ll y=idy+dy[i];
        if((x>0&&x<=n&&y>0&&y<=n)&&v[x][y]!=0&&a[idx][idy]!=a[x][y]){
            v[x][y]=1;
            dfs(x,y,a[x][y]);
        }
    }
} 
int main()
{
    cin>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cin>>a[i][j];
        }
    }
    for(int i=0;i<m;i++){
        cin>>xx>>yy;
        v[xx][yy]=1;
        dfs(xx,yy,a[xx][yy]);
        cout<<ans<<endl;
        ans=1;
        memset(v,0,sizeof(v));
    }
    return 0;
}