#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define ll long long
#define lf double
#define _1 first
#define _2 second
#define _mp make_pair
#define _pb push_back
#define inf 2222222222222222222ll
#define MAX_N 1004

using namespace std;

ll read(){ll x = 0;char c = 0, v = 0;do{c = getchar();if(c == '-')v = 1;} while(c < '0' || c > '9');do{x = (x << 3) + (x << 1) + c - '0';c = getchar();} while(c >= '0' && c <= '9');if(v)return -x;return x;}

int n, m, q;
bool a[MAX_N][MAX_N];
bool sta[MAX_N][MAX_N];
bool iscut[MAX_N][MAX_N];
int cnt[MAX_N * 2];

vector<pair<int, int> > now, lst;
vector<int> res;

bool located(int x, int y, bool oprt)
{
    a[x][y] = 1;
    if(!sta[x][y])
        return 1;
    sta[x][y] = 0;
    if((--cnt[x + y]) == 1)
        res._pb(x + y);
    now._pb(_mp(x, y));
    while(now.size())
    {
        lst = now, now.clear();
        for(auto i: lst)
        {
            int nx = i._1 + 1, ny = i._2;
            bool nd = (sta[nx - 1][ny] || sta[nx][ny - 1]);
            if(!a[nx][ny] && sta[nx][ny] && !nd)
            {
                sta[nx][ny] = 0;
                if(!now.size() || now[now.size() - 1] != _mp(nx, ny))
                {
                    if(iscut[nx][ny])
                    {
                        printf("ERROR\n");
                        return 0;
                    }
                    if((--cnt[nx + ny]) == 1)
                        res._pb(nx + ny);
                    now._pb(_mp(nx, ny));
                }
            }
            nx = i._1, ny = i._2 + 1;
            nd = (sta[nx - 1][ny] || sta[nx][ny - 1]);
            if(!a[nx][ny] && sta[nx][ny] && !nd)
            {
                sta[nx][ny] = 0;
                if(!now.size() || now[now.size() - 1] != _mp(nx, ny))
                {
                    if(iscut[nx][ny])
                    {
                        printf("ERROR\n");
                        return 0;
                    }
                    if((--cnt[nx + ny]) == 1)
                        res._pb(nx + ny);
                    now._pb(_mp(nx, ny));
                }
            }
        }
    }
    now.clear(), lst.clear();
    now._pb(_mp(x, y));
    while(now.size())
    {
        lst = now, now.clear();
        for(auto i: lst)
        {
            int nx = i._1 - 1, ny = i._2;
            bool nd = (sta[nx + 1][ny] || sta[nx][ny + 1]);
            if(!a[nx][ny] && sta[nx][ny] && !nd)
            {
                sta[nx][ny] = 0;
                if(!now.size() || now[now.size() - 1] != _mp(nx, ny))
                {
                    if(iscut[nx][ny])
                    {
                        printf("ERROR\n");
                        return 0;
                    }
                    if((--cnt[nx + ny]) == 1)
                        res._pb(nx + ny);
                    now._pb(_mp(nx, ny));
                }
            }
            nx = i._1, ny = i._2 - 1;
            nd = (sta[nx + 1][ny] || sta[nx][ny + 1]);
            if(!a[nx][ny] && sta[nx][ny] && !nd)
            {
                sta[nx][ny] = 0;
                if(!now.size() || now[now.size() - 1] != _mp(nx, ny))
                {
                    if(iscut[nx][ny])
                    {
                        printf("ERROR\n");
                        return 0;
                    }
                    if((--cnt[nx + ny]) == 1)
                        res._pb(nx + ny);
                    now._pb(_mp(nx, ny));
                }
            }
        }
    }
    now.clear(), lst.clear();
    for(auto o: res)
        for(int i = 1; i < o; i++)
        {
            int j = o - i;
            if(1 <= i && i <= n && 1 <= j && j <= m && sta[i][j])
                iscut[i][j] = 1;
        }
    res.clear();
    /*if(!oprt)
        return;
    for(int i = 1; i <= n; i++, printf("\n"))
        for(int j = 1; j <= m; j++)
            printf("%d", sta1[i][j]);
    printf("\n");
    for(int i = 1; i <= n; i++, printf("\n"))
        for(int j = 1; j <= m; j++)
            printf("%d", sta2[i][j]);
    printf("\n");
    for(int i = 1; i <= n; i++, printf("\n"))
        for(int j = 1; j <= m; j++)
            printf("%d", (int)iscut[i][j]);
    printf("\n");*/
    return 1;
}

int main()
{
    n = read();
    m = read();
    iscut[1][1] = 1, iscut[n][m] = 1;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cnt[i + j]++, sta[i][j] = 1;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            if(read())
                located(i, j, 0);
    q = read();
    for(int o = 1; o <= q; o++)
    {
        int x = read();
        int y = read();
        if(iscut[x][y] || !located(x, y, 1))
            printf("0\n");
        else
            printf("1\n");
    }
    return 0;
}