#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <iomanip>
#include <queue>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
int main()
{   
    ll H , W , Q;
    cin >> H >> W >> Q ;
    ll y[Q] , x[Q] ;
    ll h[W] ;
    for(ll j = 0 ; j < W ; j++){
         h[j] = H ; ;
    }
    for(ll i = 0 ; i < Q ; i++){
        cin >> y[i] >> x[i] ;
    }

    ll ans = H * W ;

    for(ll i= 0 ; i < Q ; i++){
        //cout << h[x[i]-1] << endl; 
        if(h[x[i]-1] >= y[i]){
            ans -= h[x[i]-1] - y[i] + 1 ;
            h[x[i]-1] = y[i] -1;
        }
        cout << ans << endl;
    }



}