#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 1005;
char maze[MAXN][MAXN];
bool visited[MAXN][MAXN];
int n, m;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int dfs(int x, int y) {
	visited[x][y] = true;
	int cnt = 1;
	for (int i = 0; i < 4; i++) {
		int nx = x + dx[i];
		int ny = y + dy[i];
		if (nx >= 1 && nx <= n && ny >= 1 && ny <= n && !visited[nx][ny] && maze[nx][ny] != maze[x][y]) cnt += dfs(nx, ny);
	}
	return cnt;
}
int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) cin >> maze[i][j];
	}
	while (m--) {
		int x, y;
		cin >> x >> y;
		memset(visited, false, sizeof(visited));
		cout << dfs(x, y) << endl;
	}
	return 0;
}