#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using ll = long long;
#define all(p) p.begin(), p.end()

struct UF{
    int n;
    vector<int> par;
    UF(int n_):n(n_){
        par.resize(n, -1);
    }
    int root(int a){
        if (par[a] < 0) return a;
        return par[a] = root(par[a]);
    }
    int unite(int a, int b){
        a = root(a);
        b = root(b);
        if (a == b) return 0;
        if (par[a] > par[b]) swap(a, b);
        par[a] += par[b];
        par[b] = a;
        return 1;
    }
};

void solve(){
    int N, M, K;
    cin >> N >> M >> K;
    UF T((N + 1) * (M + 1));
    int S = 0, I = 0, B = 0, C = 0;
    vector seen(N + 2, vector<int>(M + 2));
    vector<int> dx = {0, 0, 1, -1, 1, 1, -1, -1}, dy = {1, -1, 0, 0, 1, -1, 1, -1};
    rep(i, 0, K){
        int x, y;
        cin >> x >> y;
        set<int> s;
        rep(k, 0, 4){
            int a = dx[k] + x, b = dy[k] + y;
            if (a < 0 || b < 0 || a > N || b > M) continue;
            if (seen[a][b] == 0) continue;
            s.insert(T.root(a * (M + 1) + b));
        }
        int nS = S + 1;
        int nC = C + 1 - s.size();
        int nB = B;
        int nI = I;
        rep(k, 4, 8){
            if (seen[x + dx[k]][y] == 0 && seen[x][y + dy[k]] == 0) nB += 1;
            if (seen[x + dx[k]][y] == 1 && seen[x][y + dy[k]] == 1){
                nB -= 1;
                if (seen[x + dx[k]][y + dy[k]]){
                    nI += 1;
                }
            }
        }
        if (nS == nI + nB / 2 - nC){
            seen[x][y] = 1;
            S = nS, I = nI, B = nB, C = nC;
            for (auto z : s) T.unite(z, x * (M + 1) + y);
            cout << "1";
        }
        else{
            cout << "0";
        }
    }
    cout << "\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) solve();
}
/*
4 3 7
2 1
2 2
2 3
3 1
3 2
4 1
4 2

3 3 8
1 1
1 2
1 3
2 3
3 3
3 2
3 1
2 1
*/