#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;

constexpr ll MAX = 1000000;
bool suit[MAX];
bool number[MAX];

int main()
{
    ll w;
    ll h;
    ll n;
    cin >> w >> h >> n;
    rep(i, n)
    {
        int s, k;
        cin >> s >> k;
        s--;
        k--;
        suit[s] = true;
        number[k] = true;
    }
    ll S = 0;
    ll K = 0;
    rep(i, MAX)
    {
        if (suit[i]) {
            S++;
        }
        if (number[i]) {
            K++;
        }
    }
    cout << S * h + K * w - (S * K) - n << endl;
    return 0;
}