// 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;
int n, m, c[N][N], q;
long long pref[N][N], suff[N][N];
inline void solve()
{
cin >> n >> m;
for (int x = 1; x <= n; x++)
{
for (int y = 1; y <= m; y++)
{
cin >> c[x][y];
}
}
pref[1][1] = 1;
for (int x = 1; x <= n; x++)
{
for (int y = 1; y <= m; y++)
{
if (x == 1 && y == 1)
continue;
if (c[x][y] == 1)
{
pref[x][y] = 0;
continue;
}
pref[x][y] = pref[x - 1][y] + pref[x][y - 1];
pref[x][y] %= MOD;
}
}
suff[n][m] = 1;
for (int x = n; x >= 1; x--)
{
for (int y = m; y >= 1; y--)
{
if (x == n && y == m)
continue;
if (c[x][y] == 1)
{
suff[x][y] = 0;
continue;
}
suff[x][y] = suff[x + 1][y] + suff[x][y + 1];
suff[x][y] %= MOD;
}
}
cin >> q;
for (int x = 0; x < q; x++)
{
int a, b;
cin >> a >> b;
long long cnt = suff[a][b] * pref[a][b];
cnt %= MOD;
// cout << cnt << " " << pref[n][m] << "\n";
if (cnt == pref[n][m])
{
cout << 0 << "\n";
continue;
}
cout << 1 << "\n";
if (pref[a][b] == 0 || suff[a][b] == 0)
continue;
c[a][b] = 1;
pref[1][1] = 1;
for (int x = 1; x <= n; x++)
{
for (int y = 1; y <= m; y++)
{
if (x == 1 && y == 1)
continue;
if (c[x][y] == 1)
{
pref[x][y] = 0;
continue;
}
pref[x][y] = pref[x - 1][y] + pref[x][y - 1];
pref[x][y] %= MOD;
}
}
suff[n][m] = 1;
for (int x = n; x >= 1; x--)
{
for (int y = m; y >= 1; y--)
{
if (x == n && y == m)
continue;
if (c[x][y] == 1)
{
suff[x][y] = 0;
continue;
}
suff[x][y] = suff[x + 1][y] + suff[x][y + 1];
suff[x][y] %= MOD;
}
}
}
}
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;
}
