#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll H, W, Q;
  cin >> H >> W >> Q;
  ll ans = W * H;
  map<ll, ll> mp;
  for (ll i = 0; i < Q; ++i) {
    ll y, x;
    cin >> y >> x;
    y -= 1, x -= 1;
    if (mp.find(x) == mp.end()) {
      mp[x] = H;
    }
    ll before = mp[x];
    ll now = y;
    chmin(mp[x], y);
    ans -= max(0ll, before - now);
    cout << ans << "\n";
  }
}