#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
#include<map>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = size_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
template<typename T>
using vec = vector<T>;
#define rep(i, n) for (i64 i = 0; i < (i64)(n); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define len(hoge) (i64)((hoge).size())
using P = pair<i64,i64>;
void solve(){
}
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    i64 h,w,q;
    cin >> h >> w >> q;
    map<i64,i64> mp;
    i64 ans = h * w;
    rep(i,q){
        i64 y,x;
        cin >> y >> x;
        x--,y--;
        if(mp.count(x)){
            if(mp[x] > y){
                ans -= mp[x] - y;
                mp[x] = y;
            }
        }else{
            mp[x] = y;
            ans -= h - mp[x];
        }
        cout << ans << endl;
    }
}