#include<iostream>
#include<cstring>

using namespace std;

const int N = 1000 + 10;
char a[N][N];
int f[N][N],n, m,res;
bool ff[N][N];

int dfs(int x, int y)
{
    ff[x][y] = 1;
    int cnt = 1;
    int dx[4] = { -1,+1,0,0 }, dy[4] = { 0,0,-1,+1 };
    for (int i = 0; i <= 3; i++) {
        if (x + dx[i] >= 1 && x + dx[i] <= n && y + dy[i] >= 1 && y + dy[i] <= n) {
            if (a[x + dx[i]][y + dy[i]] != a[x][y]&&!ff[x+dx[i]][y+dy[i]]) {
                cnt += dfs(x + dx[i], y + dy[i]);
            }
        }
    }

    return cnt;
}
void setF(int x)
{
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (ff[i][j]) f[i][j] = x;
        }
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        scanf("%s", a[i] + 1);
    }
    int x = 0, y = 0;
    while (m--) {
        res = 0;
        cin >> x >> y;
        if (f[x][y]) {
            printf("%d\n", f[x][y]);
            continue;
        }
        res+=dfs(x, y);
        printf("%d\n", res);
        setF(res);
        memset(ff, 0, sizeof ff);
    }

    return 0;
}