#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 = 2e6 + 10;

int f[MN], siz[MN];
int cnt;
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;
    cnt--;
    f[a] = b;
    siz[b] += siz[a];
}
void ini(int n){
    cnt = 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 {
        x++, y++;
        return (x - 1) * (m + 2) + y + type * n * m;
    };

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

    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 + 2, V<int>(m + 2));

    for(int i = 1; i <= k; i++) {
        int x, y; cin >> x >> y;
        auto n_hav = hav;
        n_hav[x][y] = 1;
        ini((n + 2) * (m + 2));
        for(int i = 0; i <= n + 1; i++) {
            for(int j = 0; j <= m + 1; j++) {
                // if (n_hav[i][j] == 0) continue;
                for(int ni = i - 1; ni <= i + 1; ni++) 
                for(int nj = j - 1; nj <= j + 1; nj++) 
                if(!out(ni, nj) && !(ni == i && nj == j) && n_hav[i][j] == 0 && n_hav[ni][nj] == 0) mer(id(i, j, 0), id(ni, nj, 0)); 

                if(n_hav[i][j]) cnt--;
            }
        }
        // for(int i = 0; i <= )
        if(cnt != 1) cout << 0;
        else hav = n_hav, cout << 1;
    }

}