#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll h,w;
  cin >> h >> w;
  ll n;
  cin >> n;
  V<ll> cn(h,0), cnt(w, 0);
  V<ll> s(n), k(n);
  set<ll> a,b;
  set<pair<ll,ll>> st;
  rep(i,n){
  	cin >> s[i] >> k[i];
  	s[i]--;
  	k[i]--;
  	st.insert({s[i], k[i]});
  	a.insert(s[i]);
  	b.insert(k[i]);
  	cn[s[i]]++;
  	cnt[k[i]]++;
  }
  ll ans = 0;
  all(i, a) ans += h-cn[i];
  all(i, b) ans += w-cnt[i];
  all(i, a) all(j, b) ans -= 1-st.count({i, j});
  cout << ans << endl;
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}