#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define ll long long
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int N=2e3+5;
int n,m,q,cnt[N],A[N][N];
queue <pii> Q;
void mark(int x,int y){
    if(A[x][y])return;
    A[x][y]=1,cnt[x+y]--;
    Q.push({x,y});
}
bool upd(int x,int y){
    if(A[x][y])return 1;
    if(cnt[x+y]==1)return 0;
    mark(x,y);
    while(!Q.empty()){
        int x=Q.front().fi,y=Q.front().se;
        Q.pop();
        if(A[x-1][y+1]){
            mark(x,y+1);
            mark(x-1,y);
        }
        if(A[x+1][y-1]){
            mark(x+1,y);
            mark(x,y-1);
        }
    }
    return 1;
}
int main(){
    n=read(),m=read();
    rep(i,0,n+1)A[i][0]=A[i][m+1]=1;
    rep(i,0,m+1)A[0][i]=A[n+1][i]=1;
    rep(i,1,n)rep(j,1,m)cnt[i+j]++;
    rep(i,1,n)rep(j,1,m){
        int x=read();
        if(x)upd(i,j);
    }
    q=read();
    while(q--){
        int x=read(),y=read();
        if(upd(x,y))puts("1");
        else puts("0");
    }
    return 0;
}