#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int h, w, q;
  cin >> h >> w >> q;
  ll ans = (ll)h*w;
  map<int, int> mp;
  while(q--){
    int y, x;
    cin >> y >> x;
    int bf = h+1;
    if(mp.find(x) != mp.end()){
      bf = mp[x];
    }
    if(bf > y){
      ans -= bf - y;
      mp[x] = y;
    }
    cout << ans << endl;
  }
  return 0;
}