#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void setIo(string in="", string out=""){
if (!in.empty() && !out.empty()){
freopen(in.c_str(), "r", stdin);
freopen(out.c_str(), "w", stdout);
}
ios::sync_with_stdio(false);
cin.tie(0);
}
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define vt vector
#define pb emplace_back
#define F first
#define S second
#define pll pair<ll,ll>
#define MP make_pair
int first_true(int lo, int hi, function<bool(int)> f) {
hi++;
while (lo < hi) {
int mid = lo + (hi - lo)/2;
if (f(mid)) hi = mid;
else lo = mid + 1;
}
return lo;
}
class Bazooka {
private:
vt<int> row, rw; // For top path
vt<int> col, cl; // For bottom pat
int n,m;
public:
void build(int N, int M){
n = N, m = M;
row.assign(n, 0); rw.assign(n, 0);
col.assign(m, 0); cl.assign(m, 0);
}
void insert(int x, int y){ // O(M*N) on amortization
rw[x]=m-y;
if (y == m-1 || x == 0 ? 1 : abs((m-y) - row[x-1]) == 1){
int r = first_true(0, n-1, [&](int i){return row[i] < m-y;});
for (int i=r;i<=x;i++) row[i]=m-y;
while(x+1<n && row[x+1] < rw[x+1]){
row[x]=rw[x];
x++;
}
}
cl[y]=n-x;
if (x == n-1 || y == m-1 ? 1 : abs((n-x)-col[y+1])==1){
int c = first_true(0, m-1, [&](int j){return col[j] < n-x;});
for (int j=c;j<=y;j++) col[j]=n-x;
while(y+1<m && col[y+1] < cl[y]){
col[y]=cl[y];
y++;
}
}
}
bool iscritical(int x, int y){ // (x,y) =! (0,0) && (x,y) != (n-1,m-1)
bool up = (x>0?m-row[x-1]<=y:y<m-row[x]);
bool right = (m-row[x]==y+1);
bool corner_ur = (x>0&&y>0?m-row[x-1]==y+1:0);
bool top = up || right || corner_ur;
// cout << up << " " << right << " " << corner_ur << endl;
bool down = (x<n-1?n-col[y]==x+1:y<m-row[x]);
bool left = (m-row[x] == y+1);
bool corner_dl = (x<n-1&&y<m-1?m-row[x+1]==y-1:0);
bool bottom = down || left || corner_dl;
// cout << down << " " << left << " " << corner_dl << endl;
return top && bottom;
}
};
void solve(){
int n,m; cin>>n>>m;
Bazooka john;
john.build(n, m);
for (int i=0;i<n;i++){
for (int j=0;j<m;j++){
int c; cin>>c;
if (c) john.insert(i,j);
}
}
int q; cin>>q;
while(q--){
int x,y; cin>>x>>y; x--,y--;
if (john.iscritical(x, y)){
cout << 0 << endl;
continue;
} else {
cout << 1 << endl;
john.insert(x, y);
}
}
}
int main(){
setIo();
int tt=1;
// cin>>tt;
while(tt--) solve();
return 0;
}
