#include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> using lqueue = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using gqueue = priority_queue<T, vector<T>, less<T>>;

int main() {
    int64_t h, w, q; cin >> h >> w >> q;

    int64_t sub = 0;
    map<int, int> used;
    while (q--) {
        int y, x; cin >> y >> x;
        if (used[x] < h - y + 1) {
            sub += h - y + 1 - used[x];
            used[x] = h - y + 1;
        }
        cout << h * w - sub << endl;
    }
}