#include <bits/stdc++.h>
using namespace std;
int main(){
  int H, W, Q;
  cin >> H >> W >> Q;
  map<int, int> mp;
  long long ans = (long long) H * W;
  for (int i = 0; i < Q; i++){
    int Y, X;
    cin >> Y >> X;
    X--;
    Y--;
    if (!mp.count(X)){
      mp[X] = H;
    }
    if (mp[X] > Y){
      ans -= mp[X] - Y;
      mp[X] = Y;
    }
    cout << ans << endl;
  }
}