#include<bits/stdc++.h>usingnamespace std;#definexfirst#defineysecondconstint N =110;typedef pair<int,int>PII;bool g[N][N], st[N][N];//标记障碍、标记这个点是不是已经用过
PII match[N][N];//记录对象int n, m, k;int dx[8]={-1,-2,-2,-1,1,2,2,1};int dy[8]={-2,-1,1,2,2,1,-1,-2};boolfind(int xx,int yy){for(int i =0; i <8; i ++){int a = xx + dx[i], b = yy + dy[i];if(a <1|| a > n || b <1|| b > m)continue;if(st[a][b]|| g[a][b])continue;
st[a][b]=true;auto t = match[a][b];if(t.x ==0||find(t.x, t.y)){
match[a][b]={xx, yy};returntrue;}}returnfalse;}intmain(){
cin>>n>>m>>k;for(int i =0; i < k; i ++){//k值后面还要用,不能轻举妄动 int a, b;
cin>>a>>b;
g[a][b]=true;}int res =0;for(int i =1; i <= n; i ++){for(int j =1; j <= m; j ++){if((i + j)%2|| g[i][j])continue;//只遍历下标之和为偶数并且可用的点 memset(st,0,sizeof st);if(find(i, j)) res ++;}}
cout<<n * m - k - res<<endl;return0;}