#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 3e18+7;
int mod = 1e9+7;
int dx[] = {1, 0,-1, 0, 1, 1,-1,-1};
int dy[] = {0, 1, 0,-1, 1,-1, 1,-1};
signed main() {
    int H,W,Q;
    cin >> H >> W >> Q;
    vector<int>Y(Q),X(Q);
    int ans = H*W;
    map<int,int>Mp;
    for(int i = 0; i < Q; i++) {
        cin >> Y[i] >> X[i];
        if(!Mp.count(X[i])) {
            Mp[X[i]] = Y[i];
            ans -= H-Y[i]+1;
        }
        else if(Mp[X[i]] > Y[i]) {
            ans -= Mp[X[i]]-Y[i];
            Mp[X[i]] = Y[i];
        }
        cout << ans << endl;
    }
}