#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define fi first
#define se second
#define all1(x) (x).begin() + 1, (x).end()
typedef pair<int, int> pi;
const int MN = 6e5 + 10;

int f[MN], siz[MN];
int par(int x){
    if(x == f[x]) return x;
    return f[x] = par(f[x]);
}
void mer(int a, int b){
    a=par(a), b = par(b);
    if(a == b) return;
    f[a] = b;
    siz[b] += siz[a];
}
void ini(int n){
    for(int i = 1; i <= n; i++) f[i] = i, siz[i] = 1;
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n; cin >> n;
    int m, k; cin >> m >> k;
    ini(n * m * 2);
    auto id = [&](int x, int y, int type) -> int {
        return (x - 1) * m + y + type * n * m;
    };

    auto out = [&](int x, int y) -> bool {
        return x < 1 || y < 1 || x > n || y > m;
    };

    auto near = [&](int x, int y, int x2, int y2) -> bool {
        return (x == x2 && abs(y - y2) == 1) || (y == y2 && abs(x - x2) == 1);
    };

    V<V<int>> hav(n + 1, V<int>(m + 1));

    for(int i = 1; i <= k; i++) {
        int x, y; cin >> x >> y;
        bool ok = 1;
        V<pi> blk;
        for(int dx = -1; dx <= 1; dx++) {
            for(int dy = -1; dy <= 1; dy++) {
                if(out(x + dx, y + dy)) continue;
                f[id(x + dx, y + dy, 1)] = id(x + dx, y + dy, 1);
                if(hav[x + dx][y + dy]) blk.pb({x + dx, y + dy});
            }
        }
        for(auto p1 : blk) {
            for(auto p2 : blk) {
                if(near(p1.fi, p1.se, p2.fi, p2.se)) mer(id(p1.fi, p1.se, 1), id(p2.fi, p2.se, 1));
            }
        }
        for(auto p1 : blk) for(auto p2 : blk) {
            if(par(id(p1.fi, p1.se, 0)) == par(id(p2.fi, p2.se, 0)) && par(id(p1.fi, p1.se, 1)) != par(id(p2.fi, p2.se, 1))) ok = 0;
        }
        if(ok) {
            hav[x][y] = 1;
            for(auto p : blk) {
                if(near(p.fi, p.se, x, y)) {
                    mer(id(p.fi, p.se, 0), id(x, y, 0));
                }
            }
            cout << 1;
        } else cout << 0;
    }

}