#include<bits/stdc++.h>
using namespace std;
int s[10005][10005];
int main(){
	int n,x1,y1,x,y;
	int m,k;
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++){
		cin>>x1>>y1;
		s[x1+2][y1]=1;
		s[x1][y1+2]=1;
		s[x1-2][y1]=1;
		s[x1][y1-2]=1;
		s[x1+1][y1]=1;
		s[x1+1][y1+1]=1;
		s[x1+1][y1-1]=1;
		s[x1][y1+1]=1;
		s[x1][y1]=1;
		s[x1][y1-1]=1;
		s[x1-1][y1]=1;
		s[x1-1][y1+1]=1;
		s[x1-1][y1-1]=1;
		}
	for(int i=1;i<=k;i++){
		cin>>x>>y;
		s[x-2][y-2]=1;
		s[x-2][y-1]=1;
		s[x-2][y]=1;
		s[x-2][y+1]=1;
		s[x-2][y+2]=1;
		
		s[x-1][y-2]=1;
		s[x-1][y-1]=1;
		s[x-1][y]=1;
		s[x-1][y+1]=1;
		s[x-1][y+2]=1;
		
		s[x][y-2]=1;
		s[x][y-1]=1;
		s[x][y]=1;
		s[x][y+1]=1;
		s[x][y+2]=1;
		
		s[x+1][y-2]=1;
		s[x+1][y-1]=1;
		s[x+1][y]=1;
		s[x+1][y+1]=1;
		s[x+1][y+2]=1;
		
		
		s[x+2][y-2]=1;
		s[x+2][y-1]=1;
		s[x+2][y]=1;
		s[x+2][y+1]=1;
		s[x+2][y+2]=1;
		
	}
	int ans=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			if(s[i][j]==0) ans++;
		cout<<ans;
	return 0;
}