1 #include<stdio.h>
 2 #include<stdlib.h>
 3 #include<map>
 4 #include<set>
 5 #include<iostream>
 6 #include<cstring>
 7 #include<algorithm>
 8 #include<vector>
 9 #include<queue>
10
11 using namespace std;
12 typedef pair<int, int> pr;
13
14 int n, m;
15 int mat[1005][1005];
16 int dx[4] = {1, -1, 0, 0};
17 int dy[4] = {0, 0, 1, -1};
18
19 int id[1005][1005];
20 int cnt[1000005];
21
22 bool check(pr p)
23 {
24     int i = p.first, j = p.second;
25     return (i > 0 && i <= n && j > 0 && j <= n);
26 }
27
28 void bfs(int i, int j, int k)
29 {
30     int c = 1;
31     queue<pr>que;
32     pr st = make_pair(i, j);
33     que.push(st);
34     id[i][j] = k;
35     while(!que.empty()){
36         pr now = que.front();que.pop();
37         for(int i = 0; i < 4; i++){
38             pr tmp = make_pair(now.first + dx[i], now.second + dy[i]);
39             if(check(tmp) && !id[tmp.first][tmp.second] && mat[tmp.first][tmp.second] ^ mat[now.first][now.second]){
40                 id[tmp.first][tmp.second] = k;
41                 que.push(tmp);
42                 c++;
43             }
44         }
45     }
46     cnt[k] = c;
47 }
48
49 int main()
50 {
51     scanf("%d%d", &n, &m);
52     for(int i = 1; i <= n; i++){
53         char s[1005];
54         scanf("%s", s);
55         for(int j = 1; j <= n; j++){
56             mat[i][j] = s[j - 1] - '0';
57         }
58     }
59     int now_id = 1;
60     for(int i = 1; i <= n; i++){
61         for(int j = 1; j <= n; j++){
62             if(!id[i][j]){
63                 bfs(i, j, now_id);
64                 now_id++;
65             }
66         }
67     }
68
69     for(int i = 0; i < m; i++){
70         int x, y;
71         scanf("%d%d", &x, &y);
72         printf("%d\n", cnt[id[x][y]]);
73     }
74
75     return 0;
76 }