#include <iostream>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
using ll = long long;
#define rep(i,n) for(int i = 0;i<n;i++)
#define req(i,n) for(int i = 1;i<=n;i++)
#define rrep(i,n) for(int i = n-1;i>=0;i++)
#define ALL(a) a.begin(),a.end()
using namespace std;
int main(){
    ll h, w, q, x, y; cin >> h >> w >> q;
    map<int, ll> mp; ll sum = h*w,cnt=0;
    rep(i, q) {
        cin >> y >> x;
        if (mp[x] < (h - y + 1))sum-= (h-y+1)-mp[x],mp[x] = h - y+1;
        cout << sum << endl;
    }
}