#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<bool>> v(n, vector<bool>(m));
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < m; ++j) {
int x;cin>>x;
v[i][j] = x;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (i == 0 && j == 0) continue;
if ((i==0 || v[i-1][j]==1) && (j==0 || v[i][j-1] == 1)) {
v[i][j] = 1;
}
}
}
int q;cin>>q;
vector<pair<int,int>> fr(n);
while (q--) {
int x, y;cin>>x>>y;
x--, y--;
if (v[x][y] == 1) {
cout << 1 << '\n';
continue;
}
int l = y, r = y;
if (x > 0) {
while (r + 1 < m && v[x-1][r+1] == 1) r++;
} else r = m - 1;
fr[x] = {l, r};
for (int i = x + 1; i < n; i++) {
while (l <= r && ((l > 0 && v[i][l-1] == 0) || v[i][l] == 1)) l++;
if (l > r) {
fr[i] = {-1, -1};
break;
}
while (r + 1 < m && v[i-1][r+1] == 1) r++;
fr[i] = {l, r};
}
if (l > r || r < m - 1) {
cout << 1 << '\n';
for (int i = x; i < n && fr[i].first != -1; i++) {
for (int j = fr[i].first; j <= fr[i].second && v[i][j] == 0; j++) {
v[i][j] = 1;
}
}
} else cout << 0 << '\n';
}
}
