#include<bits/stdc++.h>
using namespace std;
#pragma G++ optimize(2)
char dt[1005][1005];
int n,m,x,y,ans[405][405],t,ditu[1005][1005];
int d[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
struct node{
    int x,y,r;
};
queue<node>que;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            cin>>dt[i][j];
            ditu[i][j] = dt[i][j] - '0';
        }
    }
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            ans[i][j] = -1;
        }
    }
    for(int k = 1;k <= m;k++){
        t = 0;
        cin>>x>>y;
        node a = {x,y,0};
        que.push(a);
        ans[x][y] = 0;
        while(!que.empty()){
            int X = que.front().x,Y = que.front().y;
            for(register int i = 0;i < 4;i++){
                int newx = X + d[i][0],newy = Y + d[i][1];
                if(newx >= 1 && newx <= n && newy >= 1 && newy <= n&& ans[newx][newy] == -1){
                    a = {newx,newy,que.front().r + 1};
                    que.push(a);
                    ans[newx][newy] = que.front().r + 1;
                }
            }
            que.pop();
        }
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= n;j++){
                if(ans[i][j] != -1){
                    t++;
                }
            }
        }
        cout<<t<<'\n';
    }
    return 0;
}

半天查不出来错，各位大佬帮看一下