// Starcraft 2 enjoyer //
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define LSOne(X) ((X) & -(X))
const int N = 1e3 + 5;
const int M = 1 << 10 + 5;
const int B = 18;
const long long K = 2;
const int LG = 60;
const long long INF = 1e18 + 5;
const int C = 26;
const int MOD = 1e9 + 7;
const int nx[] = {0, 1, 0, -1}, ny[] = {-1, 0, 1, 0};
int n, m, c[N][N], q, r[N][N], cnt[2 * N], num[2 * N];
void dfs(int x, int y)
{
cnt[x + y] -= r[x][y];
if ((r[x - 1][y] & r[x][y - 1]) || (r[x + 1][y] & r[x][y + 1]))
{
r[x][y] = 1;
}
cnt[x + y] += r[x][y];
if (!r[x][y])
return;
for (int i = 0; i < 4; i++)
{
int nnx = x + nx[i], nny = y + ny[i];
if (nnx < 1 || nnx > n || nny < 1 || nny > m)
{
continue;
}
if (r[nnx][nny])
continue;
dfs(nnx, nny);
}
}
inline void solve()
{
cin >> n >> m;
for (int x = 1; x <= n; x++)
{
for (int y = 1; y <= m; y++)
{
num[x + y]++;
cin >> c[x][y];
r[x][y] = c[x][y];
}
}
for (int x = n; x >= 1; x--)
{
for (int y = m; y >= 1; y--)
{
if (x == n && y == m)
continue;
int c = r[x + 1][y] + r[x][y + 1];
if (x + 1 > n)
c++;
if (y + 1 > m)
c++;
r[x][y] |= c == 2;
}
}
for (int x = 1; x <= n; x++)
{
for (int y = 1; y <= m; y++)
{
if (x == 1 && y == 1)
continue;
int c = r[x - 1][y] + r[x][y - 1];
r[x][y] |= c == 2;
}
}
cin >> q;
for (int x = 0; x < q; x++)
{
int a, b;
cin >> a >> b;
if (r[a][b])
{
cout << 1 << "\n";
continue;
}
else
{
if (cnt[a + b] == num[a + b] - 1)
{
cout << 0 << "\n";
continue;
}
cout << 1 << "\n";
r[a][b] = 1;
cnt[a + b]++;
dfs(a, b);
}
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for (int x = 1; x <= t; x++)
{
solve();
}
return 0;
}
