#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
#define _ << " " <<
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=1010;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int n,m,q,c[N][N],st[N][N],cnt[N<<1];
bool inBoard(int x, int y){
return x>=1&&y>=1&&x<=n&&y<=m;
}
bool chk(int x, int y){
if(x==1 && y==1) return false;
if(x==n && y==m) return false;
return ((!inBoard(x+1,y)||st[x+1][y]==1) && (!inBoard(x,y+1)||st[x][y+1]==1)) ||
((!inBoard(x-1,y)||st[x-1][y]==1) && (!inBoard(x,y-1)||st[x][y-1]==1));
}
void upd(int x, int y){
cnt[x+y]--;
st[x][y]=1;
rep(d,4){
int nx=x+dx[d], ny=y+dy[d];
if(inBoard(nx,ny) && st[nx][ny]==0){
if(chk(nx,ny)) upd(nx,ny);
}
}
}
void solve(){
cin>>n>>m;
foru(i,1,n) foru(j,1,m) cnt[i+j]++;
foru(i,1,n) foru(j,1,m){
cin>>c[i][j];
if(c[i][j]==1) upd(i,j);
}
cin>>q;
foru(i,1,q){
int x,y; cin>>x>>y;
if(st[x][y]==1 || cnt[x+y]>1){
cout<<"1\n";
if(st[x][y]==0) upd(x,y);
}else{
cout<<"0\n";
}
}
}
int32_t main(){
#define task "test"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
foru(i,1,tc){
solve();
}
}
