#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int h, w, q;
    cin >> h >> w >> q;
    ll ans = (ll)h*w;
    map<int, int> m;
    for (int i = 0; i < q; ++i) {
        int y, x;
        scanf("%d %d", &y, &x);
        y--;
        if(!m.count(x)){
            ans -= h-y;
            m[x] = y;
        }else {
            ans -= max(0, m[x]-y);
            m[x] = min(m[x], y);
        }
        printf("%lld\n", ans);
    }
    return 0;
}