//P1141 
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;

const int MAXN = 1005;
int n, m, ans[100001];
char map[MAXN][MAXN];
bool visited[MAXN][MAXN];
vector<int> _x, _y;

void getPos(int x, int y) {
    if (visited[x][y]) return;
    visited[x][y] = true;
    if (x + 1 < n && map[x][y] != map[x + 1][y]) {
        getPos(x + 1, y);
    }
    if (x > 0 && map[x][y] != map[x - 1][y]) {
        getPos(x - 1, y);
    }
    if (y + 1 < n && map[x][y] != map[x][y + 1]) {
        getPos(x, y + 1);
    }
    if (y > 0 && map[x][y] != map[x][y - 1]) {
        getPos(x, y - 1);
    }
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> map[i];
    }
    for (int i = 0; i < m; i++) {
        int t1, t2;
        cin >> t1 >> t2;
        _x.push_back(t1 - 1); 
        _y.push_back(t2 - 1);
    }

    for (int i = 0; i < m; i++) {
        if (!ans[i]) {
            memset(visited, 0, sizeof(visited));
            getPos(_x[i], _y[i]);
            int s = 0;
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    if (visited[j][k]) s++;
                }
            }
            ans[i] = s;

            for (int j = i + 1; j < m; j++) {
                if (visited[_x[j]][_y[j]]) {
                    ans[j] = s;
                }
            }
        }
        printf("%d\n", ans[i]);
    }
}