#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <ios>
#include <iomanip>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <sstream>
#include <bitset>
#include <climits>
#include <stack>
#include <regex>
#include <functional>
#include <random>
#ifdef _WIN64
#  include <atcoder/all>
#endif
#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#  define __builtin_popcountl __popcnt64
#endif

using namespace std;

#define ll long long
#define rep(i, init, n) for(ll i = init; i < (ll)n; i++)
#define rrep(i, init, n) for(ll i = init; i >= (ll)n; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) (ll)(x.size())
#define Out(x) cout << x << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define Ans cout << ans << endl
#define PI 3.14159265358979
#define MOD 1000000007

const int inf32 = INT_MAX / 2;
const ll inf64 = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }

// -------------------------------------------------------------------------------------------------

int main()
{
	ll w, h, n; cin >> w >> h >> n;
	vector<ll> s(n), k(n);
	map<pair<ll, ll>, bool> hand;
	rep(i, 0, n)
	{
		cin >> s[i] >> k[i];
		hand[{s[i], k[i]}] = true;
	}

	ll ans = 0;

	rep(i, 1, w + 1)
	{
		ll cnt = 0;
		rep(j, 0, n) if (s[j] == i) cnt++;
		if (cnt) ans += h - cnt;
	}

	rep(i, 1, h + 1)
	{
		ll cnt = 0;
		rep(j, 0, n) if (k[j] == i) cnt++;
		if (cnt) ans += w - cnt;
	}

	set<pair<ll, ll>> cnt;
	rep(i, 0, n)rep(j, 0, n) if (!hand.count({ s[i],k[j] })) cnt.insert({ s[i],k[j] });
	ans -= cnt.size();

	Ans;

	return 0;
}