#include using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) begin(v),end(v) template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } using ll = long long; using pii = pair; constexpr ll INF = 1ll<<30; constexpr ll longINF = 1ll<<60; constexpr ll MOD = 1000000007; constexpr bool debug = false; //---------------------------------// int main() { int H, W, Q; cin >> H >> W >> Q; vector Y(Q), X(Q); REP(i, Q) scanf("%d %d", &Y[i], &X[i]); auto compress = [](auto &&v, auto &&cv) -> void { for (auto &&u : v) cv.emplace_back(u); cv.emplace_back(INF); cv.emplace_back(-INF); std::sort(std::begin(cv), std::end(cv)); cv.erase(std::unique(std::begin(cv), std::end(cv)), std::end(cv)); for (auto &&u : v) u = std::lower_bound(std::begin(cv), std::end(cv), u) - std::begin(cv); }; vector cx; compress(X, cx); ll ans = (ll)H * W; vector mn(cx.size(), H + 1); REP(i, Q) { if (mn[X[i]] > Y[i]) { ans -= mn[X[i]] - Y[i]; mn[X[i]] = Y[i]; } printf("%lld\n", ans); } }