#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

struct UndoUnionFind {
    UndoUnionFind() {}

    UndoUnionFind(int n) : n(n), data(n, -1) {}

    int find(int x) const {
        assert(0 <= x && x < n);
        return data[x] < 0 ? x : find(data[x]);
    }

    bool merge(int x, int y) {
        assert(0 <= x && x < n);
        assert(0 <= y && y < n);
        x = find(x), y = find(y);
        history.emplace(x, data[x]);
        history.emplace(y, data[y]);
        if (x == y) return false;
        if (-data[x] < -data[y]) std::swap(x, y);
        data[x] += data[y];
        data[y] = x;
        return true;
    }

    bool same(int x, int y) const {
        assert(0 <= x && x < n);
        assert(0 <= y && y < n);
        return find(x) == find(y);
    }

    int size(int x) const {
        assert(0 <= x && x < n);
        return -data[find(x)];
    }

    void undo() {
        assert(!history.empty());
        data[history.top().first] = history.top().second;
        history.pop();
        data[history.top().first] = history.top().second;
        history.pop();
    }

    void snapshot() {
        while (!history.empty()) history.pop();
    }

    void rollback() {
        while (!history.empty()) undo();
    }

    int operator[](int x) const { return find(x); }

  private:
    int n;
    std::vector<int> data;
    std::stack<std::pair<int, int>> history;
};

using ll = long long;

using namespace std;

constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int n, m, k;
    cin >> n >> m >> k;

    vector S(n, vector<bool>(m, false));
    UndoUnionFind uf(n * m);
    auto isin = [&](int x, int y) { return 0 <= x and x < n and 0 <= y and y < m; };
    auto id = [&](int x, int y) { return x * m + y; };
    stack<tuple<int, int, int>> st;
    vector<int> es(n * m, 0), mass(n * m, 0);
    vector<set<int>> rows(n), cols(m);
    for (int i = 0; i < n; i++) {
        rows[i].emplace(-1);
        rows[i].emplace(m);
    }
    for (int i = 0; i < m; i++) {
        cols[i].emplace(-1);
        cols[i].emplace(n);
    }
    auto three = [&](int x, int y) {  // (x, y) を中心とする 3 * 3 領域が black か
        for (int ddx = -1; ddx <= 1; ddx++) {
            for (int ddy = -1; ddy <= 1; ddy++) {
                int nx = x + ddx, ny = y + ddy;
                if (not isin(nx, ny)) return false;
                if (not S[nx][ny]) return false;
            }
        }
        return true;
    };
    auto two = [&](int x, int y) {  // (x, y) を左上とする 2 * 2 領域が black か
        for (int ddx = 0; ddx <= 1; ddx++) {
            for (int ddy = 0; ddy <= 1; ddy++) {
                int nx = x + ddx, ny = y + ddy;
                if (not isin(nx, ny)) return false;
                if (not S[nx][ny]) return false;
            }
        }
        return true;
    };
    auto f = [&](int r, int c) {
        S[r][c] = true;
        for (int i = 0; i < 4; i++) {
            int nx = r + dx[i], ny = c + dy[i];
            if (not isin(nx, ny)) continue;
            if (not S[nx][ny]) continue;
            int u = id(r, c), v = id(nx, ny);
            u = uf.find(u), v = uf.find(v);
            st.emplace(u, es[u], mass[u]);
            st.emplace(v, es[v], mass[v]);
            uf.merge(u, v);
            if (u != v) {
                int w = uf.find(u);
                es[w] = es[u] + es[v] + 1;
                mass[w] = mass[u] + mass[v];
            } else {
                es[u]++;
            }
        }
        int root = uf.find(id(r, c));
        for (int ddx = -1; ddx <= 0; ddx++) {
            for (int ddy = -1; ddy <= 0; ddy++) {
                int nx = r + ddx, ny = c + ddy;
                if (two(nx, ny)) mass[root]++;
            }
        }
        rows[r].emplace(c);
        cols[c].emplace(r);
    };
    auto g = [&](int r, int c) {
        int root = uf.find(id(r, c));
        for (int ddx = -1; ddx <= 0; ddx++) {
            for (int ddy = -1; ddy <= 0; ddy++) {
                int nx = r + ddx, ny = c + ddy;
                if (two(nx, ny)) mass[root]--;
            }
        }
        S[r][c] = false;
        for (int i = 3; i >= 0; i--) {
            int nx = r + dx[i], ny = c + dy[i];
            if (not isin(nx, ny)) continue;
            if (not S[nx][ny]) continue;
            for (int _ = 0; _ < 2; _++) {
                auto [idx, e, m] = st.top();
                st.pop();
                es[idx] = e;
                mass[idx] = m;
            }
            uf.undo();
        }
        rows[r].erase(c);
        cols[c].erase(r);
    };
    auto query = [&](int r, int c) -> bool {
        for (int ddx = -1; ddx <= 1; ddx++) {
            for (int ddy = -1; ddy <= 1; ddy++) {
                int nx = r + ddx, ny = c + ddy;
                if (three(nx, ny)) return false;
                // if (not isin(nx, ny) or S[nx][ny]) continue;
                // vector<pair<int, int>> tmp;
                // {
                //     auto itr = rows[nx].lower_bound(ny);
                //     tmp.emplace_back(nx, *itr);
                //     tmp.emplace_back(nx, *prev(itr));
                // }
                // {
                //     auto itr = cols[ny].lower_bound(nx);
                //     tmp.emplace_back(*itr, ny);
                //     tmp.emplace_back(*prev(itr), ny);
                // }
                // bool ok = true;
                // for (auto [nnx, nny] : tmp) {
                //     if (not isin(nnx, nny)) {
                //         ok = false;
                //     }
                // }
                // if (ok) {
                //     for (int i = 0; i < 3; i++) {
                //         if (not uf.same(id(tmp[i].first, tmp[i].second), id(tmp[i + 1].first, tmp[i + 1].second))) {
                //             ok = false;
                //         }
                //     }
                //     if (ok) return false;
                // }
            }
        }
        int root = uf.find(id(r, c));
        debug(es[root], mass[root], uf.size(root));
        if (es[root] - mass[root] >= uf.size(root)) return false;
        return true;
    };

    for (; k--;) {
        int r, c;
        cin >> r >> c;
        r--, c--;
        f(r, c);
        if (query(r, c)) {
            cout << "1";
        } else {
            cout << "0";
            g(r, c);
        }
    }
    cout << "\n";
    return 0;
}