#include<bits/stdc++.h>
using namespace std;
int a[1005][1005],n,m,i,j,anscnt=1,ans[1001000];
int b[1005][1005],c[1005][1005];//是否走过，染色
struct pos{
	int x,y,z;
};
void bfs(int x,int y,int z){
	queue<pos>q;
	pos tmp;
	tmp.x=x,tmp.y=y,tmp.z=z;
	q.push(tmp);
	int cnt=0;
	while(!q.empty()){
		pos now=q.front();
		q.pop();
		if(now.x<1||now.x>n||now.y<1||now.y>n||now.z!=a[now.x][now.y]||b[now.x][now.y]||c[now.x][now.y]!=0)return;
		b[now.x][now.y]=1,c[now.x][now.y]=anscnt,cnt++;
		pos nxt;
		nxt.x=now.x+1,nxt.y=now.y,nxt.z=!now.z;
		q.push(nxt);
		nxt.x=now.x-1,nxt.y=now.y,nxt.z=!now.z;
		q.push(nxt);
		nxt.x=now.x,nxt.y=now.y+1,nxt.z=!now.z;
		q.push(nxt);
		nxt.x=now.x,nxt.y=now.y,nxt.z=!now.z;
		q.push(nxt);
		b[now.x][now.y]=0;
	}
	ans[anscnt]=cnt;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&a[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(c[i][j]==0)bfs(i,j,a[i][j]);
			anscnt++;
		}
	}
	for(int i=1;i<=m;i++){
		scanf("%d%d",&i,&j);
		printf("%d\n",ans[c[i][j]]);
	}
	return 0;
}