#include <bits/stdc++.h>
using namespace std;
#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;
const int MXN = 1005;
int n, m, q, br;
bitset<MXN> b[MXN];
int cnt[MXN * 2];
void PRE() {
FOR(i, 0, n + 2) FOR(j, 0, m + 2) if (b[i][j] == 0) cnt[i + j]++;
}
bool PUT(int x, int y) {
if (b[x][y]) return true;
if (cnt[x + y] == 1) return false;
b[x][y] = 1;
cnt[x + y]--;
queue<pii> q;
q.push(mp(x + 1, y));
q.push(mp(x, y + 1));
while (q.size()) {
auto [xx, yy] = q.front();
q.pop();
debug(xx, yy, 1);
if (b[xx][yy] == 1) continue;
if (!b[xx - 1][yy] || !b[xx][yy - 1]) continue;
b[xx][yy] = 1;
cnt[xx + yy]--;
q.push(mp(xx + 1, yy));
q.push(mp(xx, yy + 1));
}
q.push(mp(x - 1, y));
q.push(mp(x, y - 1));
while (q.size()) {
auto [xx, yy] = q.front();
q.pop();
debug(xx, yy);
if (b[xx][yy] == 1) continue;
if (!b[xx + 1][yy] || !b[xx][yy + 1]) continue;
b[xx][yy] = 1;
cnt[xx + yy]--;
q.push(mp(xx - 1, yy));
q.push(mp(xx, yy - 1));
}
return true;
}
void miku() {
cin >> n >> m;
b[0].set();
b[n + 1].set();
FOR(i, 1, n + 1) {
b[i][0] = true;
b[i][m + 1] = true;
}
PRE();
FOR(i, 1, n + 1) FOR(j, 1, m + 1) {
cin >> br;
if (br) PUT(i, j);
}
cin >> q;
while (q--) {
int x, y;
cin >> x >> y;
debug(x, y);
cout << PUT(x, y) << '\n';
}
}
int32_t main() {
cin.tie(0) -> sync_with_stdio(false);
cin.exceptions(cin.failbit);
miku();
return 0;
}
