#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int w, h, n;
    ll ans = 0;
    cin >> w >> h >> n;
    int suit_n = w, num_n = h;
    vector<int> suit(w), num(h);
    for (int i = 0; i < n; i++){
        int s, k;
        cin >> s >> k;
        if (suit[s-1]){
            if (!num[k-1]){
                ans--;
                num[k-1]++;
                if (num_n) num_n--;
                ans += suit_n;
                if (!(num_n)) suit_n = 0;
            } else ans--;
        } else {
            if (num[k-1]){
                ans--;
                suit[s-1]++;
                if (suit_n) suit_n--;
                ans += num_n;
                if (!(suit_n)) num_n = 0;
            } else {
                suit[s-1]++;
                num[k-1]++;
                if (num_n) num_n--;
                if (suit_n) suit_n--;
                ans += (num_n + suit_n);
                if (!(suit_n)) num_n = 0;
                if (!(num_n)) suit_n = 0;
            }
        }
    }
    cout << ans << endl;
}