#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std; // NOLINT

int main() {
    int32_t h, w, q;
    cin >> h >> w >> q;
    unordered_map<int32_t, int32_t> mp;
    vector<int64_t> ans(q);
    int64_t sum = int64_t(h) * w;
    for (auto &&a : ans) {
        int32_t y, x;
        cin >> y >> x;
        if (mp.find(x) == mp.end()) {
            sum -= h - y + 1;
            a = sum;
            mp[x] = y;
        } else {
            auto yy = mp[x];
            if (y < yy) {
                sum -= yy - y;
                a = sum;
                mp[x] = y;
            } else {
                a = sum;
            }
        }
    }
    for (auto a : ans) {
        cout << a << endl;
    }
    return 0;
}