#include<bits/stdc++.h>
using namespace std;
bool a[1005][1005]={0};
int i,j,n,m,k,sum=0,o,p;
int main(){
	cin>>n>>m>>k;
	
		for(int x=1;x<=m;x++){
				cin>>i>>j;
				a[i][j]=1;
			
				a[i+1][j]=1;
				a[i+2][j]=1;
				a[i][j+1]=1;
				a[i][j+2]=1;
			
			    a[i-1][j]=1;
			    a[i-2][j]=1;
			    a[i][j-1]=1;
			    a[i][j-2]=1;
			
				a[i+1][j+1]=1;
				a[i+1][j-1]=1;
				a[i-1][j+1]=1;
				a[i-1][j-1]=1;
			
		}
		for(int x=1;x<=k;x++){
			
				cin>>o>>p;
				a[o][p]=1;
				a[o+1][p]=1;
				a[o+2][p]=1;
				a[o][p+1]=1;
				a[o][p+2]=1;
				
		     	a[o-1][p]=1;
			    a[o-2][p]=1;
			    a[o][p-1]=1;
			    a[o][p-2]=1;
			
				a[o+1][p+1]=1;
				a[o+1][p-1]=1;
				a[o-1][p+1]=1;
				a[o-1][p-1]=1;
				
				a[o+2][p+1]=1;
				a[o+2][p-1]=1;
				a[o-2][p+1]=1;
				a[o-2][p-1]=1;
				
				a[o+1][p+2]=1;
				a[o+1][p-2]=1;
				a[o-1][p+2]=1;
				a[o-1][p-2]=1;
				
				a[o+2][p+2]=1;
				a[o+2][p-2]=1;
				a[o-2][p+2]=1;
				a[o-2][p-2]=1;
			
		}
		for(int x=1;x<=n;x++){
			for(int y=1;y<=n;y++){
				if(!a[x][y]){
					sum++;
				}
			}
		}

	cout<<sum;
	return 0;
}