#include <bits/stdc++.h>
using namespace std;
const int N = 1e3+10;
const int NN = 1e5+10;
int f[N][N], a[N][N], vis[N][N], n, m, xx, yy;
pair<int, int> fa[N][N];
int dx[6] = {0, 1, -1, 0, 0};
int dy[6] = {0, 0, 0, 1, -1};
void bfs(int x, int y)
{
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++) vis[i][j] = 0;
	vis[x][y] = 1;
	pair<int, int> q[NN];
	int h=1, t=0;
	q[++t] = {x, y};
	while(h<=t)
	{
		int nx = q[h].first, ny = q[h++].second;
		for(int i=1;i<=4;i++)
			if(dx[i]+nx<1||dx[i]+nx>n||dy[i]+ny<1||dy[i]+ny>n) continue;
			else if(a[dx[i]+nx][dy[i]+ny]!=a[nx][ny]&&!vis[dx[i]+nx][dy[i]+ny]) 
				f[x][y]++, vis[dx[i]+nx][dy[i]+ny] = 1, q[++t] = {dx[i]+nx,dy[i]+ny}, fa[dx[i]+nx][dy[i]+ny] = {x, y};
	}
	f[x][y]++;
}
int main()
{
	string s;
	cin >> n >> m;
	getline(cin, s);
	for(int i=1;i<=n;i++)
	{
		getline(cin, s);
		for(int j=0;j<n;j++) a[i][j+1] = s[j]-'0';
	} 
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++) fa[i][j] = {i, j};
	for(int i=1;i<=m;i++)
	{
		cin >> xx >> yy;
		if(!f[fa[xx][yy].first][fa[xx][yy].second]) bfs(xx, yy);
		cout << f[fa[xx][yy].first][fa[xx][yy].second] << endl;
	}
	return 0;
}