#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(s) (s).begin(),(s).end()
#define vcin(n) for(ll i=0;i<ll(n.size());i++) cin>>n[i]
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 2000000000000000000ll;
static const long double pi = 3.141592653589793;
template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}
template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}
ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
int main() {
  /* mod は 1e9+7 */
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
  ll h,w,q;
  swap(h,w);
  cin>>h>>w>>q;
  map<ll,ll> m;
  ll ans=h*w;
  swap(h,w);
  for(int i=0;i<q;i++){
    ll x,y;
    cin>>x>>y;
    swap(x,y);
    if(m[x]==0){
      m[x]=y;
      ans-=w+1-y;
    }
    else if(m[x]>y){
      ans+=(y-m[x]);
      m[x]=y;
    }
    cout<<ans<<endl;
  }
}