#include #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) for(int i=0;i<(n);++i) #define FORq(i, m, n) for(int i = (m);i <= (n);++i) #define SCD(n) scanf("%d",&n) #define SCD2(m,n) scanf("%d%d",&m,&n) #define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k) #define PB push_back #define MP make_pair #define ARSCD(A,N) REP(i,N){SCD(A[i]);} #define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);} #define PRINTD(n) printf("%d\n",n) #define PRINTLLD(n) printf("%lld\n",n) #define DEBUG printf("%s\n","debug") #define fst first #define snd second #define IN(x,S) (S.count(x) != 0) using namespace std; typedef pair PII; typedef vector VI; typedef long long ll; ////////////////////////////////////////////////////// int main(){ ll W,H,N; scanf("%lld %lld %lld",&W,&H,&N); set xset; set yset; ll ans = 0; FORq(i,1,N){ int x,y; SCD2(x,y); xset.insert(x); yset.insert(y); } ll Ws = xset.size(); ll Hs = yset.size(); PRINTLLD(W*H-(W-Ws)*(H-Hs)-N); return 0; }