#include <bits/stdc++.h>
using namespace std;

const int MAXN = 3e5 + 100;
int p[MAXN], sz[MAXN];

int get(int v) {
    return v == p[v] ? v : p[v] = get(p[v]);
}

void join(int u, int v) {
    u = get(u); v = get(v);
    if (u == v) return;
    if (sz[u] < sz[v]) swap(u, v);
    sz[u] += sz[v];
    p[v] = u;
}

vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};

int sample[3][3];
int col[3][3];

void dfs(int x, int y, int c) {
    col[x][y] = c;
    /// cerr << x << " " << y << "->" << c << endl;
    for (int t = 0; t < 4; ++t) {
        int x1 = x + dx[t], y1 = y + dy[t];
        if (x1 < 0 || x1 >= 3 || y1 < 0 || y1 >= 3 || sample[x1][y1] == 0) continue;
        if (col[x1][y1] == -1) {
            dfs(x1, y1, c);
        }
    }
}

void solve_() {
    int n, m, k;
    cin >> n >> m >> k;
    iota(p, p + n * m, 0);
    fill(sz, sz + n * m, 1);
    vector<vector<int>> arr(n, vector<int>(m, 0));
    while (k--) {
        int i, j;
        cin >> i >> j;
        --i; --j;
        if (arr[i][j] == 1) {
            cout << "1";
            continue;
        }
        arr[i][j] = 1;
        bool simple = true;
        for (int sx = i - 2; sx <= i && simple; ++sx) {
            for (int sy = j - 2; sy <= j && simple; ++sy) {
                if (sx < 0 || sy < 0 || sx + 3 > n || sy + 3 > m) continue;
                bool cur = false;
                for (int x = 0; x < 3 && !cur; ++x) {
                    for (int y = 0; y < 3 && !cur; ++y) {
                        cur |= (arr[sx + x][sy + y] == 0);
                    }
                }
                simple &= cur;
            }
        }
        arr[i][j] = 0;
        if (!simple) {
            cout << "0";
            continue;
        }
        vector<array<int, 2>> neigh;
        for (int t = 0; t < 4; ++t) {
            int x = i + dx[t];
            int y = j + dy[t];
            if (x < 0 || y < 0 || x >= n || y >= m || arr[x][y] == 0) continue;
            neigh.push_back({x, y});
        }
        for (int dx = -1; dx <= 1; ++dx) {
            for (int dy = -1; dy <= 1; ++dy) {
                int x = i + dx, y =  j + dy;
                if (x < 0 || y < 0 || x >= n || y >= m || arr[x][y] == 0) {
                    sample[dx + 1][dy + 1] = 0;
                } else {
                    sample[dx + 1][dy + 1] = 1;
                }
                col[dx + 1][dy + 1] = -1;
            }
        }
        int c = 0;
        for (auto elem : neigh) {
            if (col[elem[0] - i + 1][elem[1] - j + 1] == -1) {
                dfs(elem[0] - i + 1, elem[1] - j + 1, c++);
            }
        }
        /**if (i == 1 && j == 3) {
            for (int x = 0; x < 3; ++x) {
                for (int y = 0; y < 3; ++y) {
                    cerr << sample[x][y] << " ";
                }
                cerr << endl;
            }
        }*/
        bool hard = true;
        for (auto elem1 : neigh) {
            for (auto elem2 : neigh) {
                /**if (i == 2 && j == 1) {
                    cerr << elem1[0] << " " << elem1[1] << " " << elem2[0] << " " << elem2[1] << endl;
                }*/
                if (get(elem1[0] * m + elem1[1]) == get(elem2[0] * m + elem2[1])) {
                    if (col[elem1[0] - i + 1][elem1[1] - j + 1] != col[elem2[0] - i + 1][elem2[1] - j + 1]) {
                        /// cerr << i << " " << j << " " << elem1[0] << " " << elem1[1] << " " << elem2[0] << " " << elem2[1] << endl;
                        hard = false;
                    }
                }
            }
        }
        if (!hard) {
            cout << "0";
            continue;
        }
        cout << "1";
        for (auto elem : neigh) {
            join(i * m + j, elem[0] * m + elem[1]);
        }
        arr[i][j] = 1;
    }
}

/// #define MULTITEST

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}