#include <bits/stdc++.h>
using namespace std;

int main() {
	int w,h, n;
	cin >> w >> h >> n;
	vector<int> s(n), k(n);
	for (int i = 0;i < n;i++) {
		cin >> s[i] >> k[i];
	}

	set<int>sets, setk;
	for (int i = 0;i < n;i++) {
		sets.insert(s[i]);
		setk.insert(k[i]);
	}
	cout << sets.size()*h+setk.size()*(w-sets.size()) - n << endl;


	return 0;
}