#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
const int MN = 1005;
int n, m, q, r, c, a[MN][MN], reach[MN][MN], cnt[MN + MN];
void block(int i, int j) {
reach[i][j] = 0;
cnt[i + j]--;
if (!reach[i + 1][j - 1] && reach[i + 1][j]) block(i + 1, j);
if (!reach[i + 1][j - 1] && reach[i][j - 1]) block(i, j - 1);
if (!reach[i - 1][j + 1] && reach[i - 1][j]) block(i - 1, j);
if (!reach[i - 1][j + 1] && reach[i][j + 1]) block(i, j + 1);
}
int32_t main() {
boost();
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
reach[i][j] = 1;
cnt[i + j]++;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] && reach[i][j]) block(i, j);
}
}
cin >> q;
while (q--) {
cin >> r >> c;
if (!reach[r][c]) printf("1\n");
else if (cnt[r + c] == 1) printf("0\n");
else printf("1\n"), block(r, c);
}
return 0;
}
