#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 1005;

int n, m, q, a[N][N], c[N << 1];
queue<pii> Q;

inline void ins(int x, int y, int fl = 0) {
	if(x < 1 || x > n || y < 1 || y > m) return ;
	if(a[x][y] || x + y == 1 || x + y == n + m) return ;
	if(fl | (a[x - 1][y] & a[x][y - 1]) | (a[x + 1][y] & a[x][y + 1])) 
		a[x][y] = 1, --c[x + y], Q.push(mkp(x, y));
}

inline bool bfs(int x, int y) {
	if(a[x][y]) return 1;
	if(c[x + y] == 1) return 0;
	ins(x, y, 1);
	while(!Q.empty()) {
		auto [x, y] = Q.front(); Q.pop();
		if(a[x - 1][y + 1]) ins(x, y + 1), ins(x - 1, y);
		if(a[x + 1][y - 1]) ins(x + 1, y), ins(x, y - 1);
	}
	return 1;
}

signed main() {
	n = read(); m = read();
	rep(i, 1, n) rep(j, 1, m) c[i + j]++;
	rep(i, 0, m + 1) a[0][i] = a[n + 1][i] = 1;
	rep(i, 1, n) a[i][0] = a[i][m + 1] = 1;
	
	rep(i, 1, n) rep(j, 1, m) if(read()) bfs(i, j);
	
	q = read();
	for(int i = 1, x, y; i <= q; i++) {
		x = read(); y = read();
		puts(bfs(x, y) ? "1" : "0");
	}
	
	return 0;
}