#include<bits/stdc++.h>
using namespace std;
int n,m,t;
int a,b;
int book[105][105];
bool used[105][105];
int kx[8]={-2,-2,-1,-1,1,1,2,2},ky[8]={1,-1,2,-2,2,-2,1,-1};
struct oppo{
    int x,y;
}belong[105][105];
int ans;
bool find(int x,int y)
{
    for(int i=0;i<8;i++)
    {
        int xx=x+kx[i];
        int yy=y+ky[i];
        if(xx>0&&yy>0&&xx<=n&&yy<=m&&!book[xx][yy]&&!used[xx][yy])
        {
            used[xx][yy]=1;
            if(belong[xx][yy].x==0||find(belong[xx][yy].x,belong[xx][yy].y))
            {
                belong[xx][yy].x=x;
                belong[xx][yy].y=y;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    cin>>n>>m>>t;
    while(t--)
    {
        cin>>a>>b;
        book[a][b]=1;
        ans++;
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if((i+j)%2&&!book[i][j])
            {
                memset(used,0,sizeof(used));
                if(find(i,j))
                    ans++;
            }
    cout<<m*n-ans<<endl;
    return 0;
}