#include <iostream>
#include <algorithm>
#include <queue>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e3 + 10, MAXM = 1e6 + 10;

int n, m, q;
bool vis[MAXN][MAXN];
int avls[MAXN][MAXN], avlt[MAXN][MAXN];
int cnt[MAXN << 1];

queue < pair <int, int> > qu;

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            Read(vis[i][j]);
    avls[0][1] = avls[1][0] = 1;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (!vis[i][j]) avls[i][j] = (avls[i - 1][j] != 0) + (avls[i][j - 1] != 0);
    avlt[n][m + 1] = avlt[n + 1][m] = 1;
    for (int i = n; i >= 1; i--)
        for (int j = m; j >= 1; j--)
            if (!vis[i][j]) avlt[i][j] = (avlt[i + 1][j] != 0) + (avlt[i][j + 1] != 0);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (avls[i][j] && avlt[i][j]) cnt[i + j]++;
    // for (int i = 1; i <= n; i++, cout << "\n")
    //     for (int j = 1; j <= m; j++) cout << avls[i][j] << " ";
    // cout << "\n";
    // for (int i = 1; i <= n; i++, cout << "\n")
    //     for (int j = 1; j <= m; j++) cout << avlt[i][j] << " ";
    // cout << "\n";
    // for (int i = 2; i <= n + m; i++) cout << cnt[i] << " ";
    // cout << "\n";
    if (!avls[n][m]) return 0;
    Read(q);
    int u, v;
    for (int i = 1; i <= q; i++)
    {
        Read(u), Read(v);
        if (!avls[u][v] || !avlt[u][v]) {cout << "1\n"; continue;}
        if (cnt[u + v] == 1) {cout << "0\n"; continue;}
        cout << "1\n";
        avls[u][v] = avlt[u][v] = 0, cnt[u + v]--;
        qu.push(make_pair(u, v));
        while (!qu.empty())
        {
            int x = qu.front().first, y = qu.front().second; qu.pop();
            if (x != u || y != v) cnt[x + y]--, avls[x][y] = avlt[x][y] = 0;
            // cout << x << " " << y << " s\n";
            if (x < n && avls[x + 1][y] && avlt[x + 1][y])
            {
                avls[x + 1][y]--;
                if (!avls[x + 1][y]) qu.push(make_pair(x + 1, y));
            }
            if (y < m && avls[x][y + 1] && avlt[x][y + 1])
            {
                avls[x][y + 1]--;
                if (!avls[x][y + 1]) qu.push(make_pair(x, y + 1));
            }
        }
        qu.push(make_pair(u, v));
        while (!qu.empty())
        {
            int x = qu.front().first, y = qu.front().second; qu.pop();
            if (x != u || y != v) cnt[x + y]--, avls[x][y] = avlt[x][y] = 0;
            // cout << x << " " << y << " t\n";
            if (x > 1 && avls[x - 1][y] && avlt[x - 1][y])
            {
                avlt[x - 1][y]--;
                if (!avlt[x - 1][y]) qu.push(make_pair(x - 1, y));
            }
            if (y > 1 && avls[x][y - 1] && avlt[x][y - 1])
            {
                avlt[x][y - 1]--;
                if (!avlt[x][y - 1]) qu.push(make_pair(x, y - 1));
            }
        }
    }
    return 0;
}