#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>

#define x first
#define y second
#define mp make_pair

using namespace std;
typedef pair<int,int> PII;
const int N = 1e3 + 10, dxst[2] = {1, 0}, dyst[2] = {0, 1}, dxed[2] = {-1, 0}, dyed[2] = {0, -1};

int n, m, q, a[N][N], validst[N][N], valided[N][N], s[N * 2];
int read()
{
	int x = 0, t = 1; char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if(ch == '-') t = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9')
	{
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * t;
}

int valid(int x, int y)
{
	return x > 0 && y > 0 && x <= n && y <= m;
}

int main()
{
	n = read(), m = read();
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			a[i][j] = read();
		}
	}
	validst[1][1] = 1;
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			if(a[i][j]) validst[i][j] = 0;
			for(int k = 0; k < 2; k++)
			{
				int ni = i + dxst[k], nj = j + dyst[k];
				if(valid(ni, nj)) validst[ni][nj] |= validst[i][j];
			}
		}
	}
	valided[n][m] = 1;
	for(int i = n; i; i--)
	{
		for(int j = m; j; j--)
		{
			if(a[i][j]) valided[i][j] = 0;
			for(int k = 0; k < 2; k++)
			{
				int ni = i + dxed[k], nj = j + dyed[k];
				if(valid(ni, nj)) valided[ni][nj] |= valided[i][j];
			}
		}
	}
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++)
		{
			s[i + j] += (validst[i][j] & valided[i][j]);
		}
	}
	q = read();
	while(q--)
	{
		int x = read(), y = read();
		if(validst[x][y] && valided[x][y] && s[x + y] <= 1)
		{
			putchar('0'), putchar('\n');
			continue;
		}
		if(validst[x][y])
		{
			queue <PII> q;
			q.push(mp(x, y));
			s[x + y] -= (validst[x][y] & valided[x][y]);
			validst[x][y] = 0;
			while(!q.empty())
			{
				int x = q.front().x, y = q.front().y; q.pop();
				for(int k = 0; k < 2; k++)
				{
					int nx = x + dxst[k], ny = y + dyst[k];
					if(valid(nx, ny) && validst[nx][ny] && !validst[nx - 1][ny] && !validst[nx][ny - 1])
					{
						q.push(mp(nx, ny));
						s[nx + ny] -= (validst[nx][ny] & valided[nx][ny]);
						validst[nx][ny] = 0;
					}
				}
			}
		}
		if(valided[x][y])
		{
			queue <PII> q;
			q.push(mp(x, y));
			s[x + y] -= (validst[x][y] & valided[x][y]);
			valided[x][y] = 0;
			while(!q.empty())
			{
				int x = q.front().x, y = q.front().y; q.pop();
				for(int k = 0; k < 2; k++)
				{
					int nx = x + dxed[k], ny = y + dyed[k];
					if(valid(nx, ny) && valided[nx][ny] && !valided[nx + 1][ny] && !valided[nx][ny + 1])
					{
						q.push(mp(nx, ny));
						s[nx + ny] -= (validst[nx][ny] & valided[nx][ny]);
						valided[nx][ny] = 0;
					}
				}
			}
		}
		putchar('1'), putchar('\n');
	}
	return 0;
}