#include <bits/stdc++.h>usingnamespacestd;
typedeflonglong ll;
constint inf = 0x3f3f3f3f;
vector<int> xp,yp;
int main(){
int n,m,k;
cin>>n>>m>>k;
for (int i=0;i<k;i++){
int x,y;
cin>>x>>y;
xp.push_back(x);
yp.push_back(y);
}
ll ans = (ll)(n+1) * n * m * (m+1) / 4;
for (int st=1;st<(1<<k);st++){
int s = st;
int minx=inf, miny=inf, maxx=0, maxy=0;
int i = 0, cnt = 0;
while (s > 0){
if (s & 1){
minx = min (minx, xp[i]);
maxx = max (maxx, xp[i]);
miny = min (miny, yp[i]);
maxy = max (maxy, yp[i]);
cnt++;
}
i++;
s>>=1;
}
ll sum = (ll)minx * miny * (n - maxx + 1) * (m - maxy + 1);
if (cnt & 1){
ans -= sum;
}
else{
ans += sum;
}
}
cout << ans << endl;
return0;
}