rt

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
int m,k;
int x,y,sum;
int main(){
	int a;
	cin>>a>>m>>k;
	long long int n[a+100][a+100];
	memset(n,0,sizeof(n));
	for(int i=0;i<m;i++){
		cin>>x>>y;
		n[x][y]=1;
		n[abs(x-1)][y]=1;
		n[abs(x-2)][y]=1;
		n[x+1][y]=1;
		n[x+2][y]=1;
		n[x][abs(y-1)]=1;
		n[x][abs(y-2)]=1;
		n[x][y+1]=1;
		n[x][y+2]=1;
	}
	for(int i=0;i<k;i++){
		cin>>x>>y;
		n[x][y]=1;
		n[x+1][y]=1;
		n[x+2][y]=1;
		n[abs(x-1)][y]=1;
		n[abs(x-2)][y]=1;
		n[x][abs(y-1)]=1;
		n[x+1][abs(y-1)]=1;
		n[x+2][abs(y-1)]=1;
		n[abs(x-1)][abs(y-1)]=1;
		n[abs(x-2)][abs(y-1)]=1;
		n[x][abs(y-2)]=1;
		n[x+1][abs(y-2)]=1;
		n[x+2][abs(y-2)]=1;
		n[abs(x-1)][abs(y-2)]=1;
		n[abs(x-2)][abs(y-2)]=1;
		n[x][y+1]=1;
		n[x+1][y+1]=1;
		n[x+2][y+1]=1;
		n[abs(x-1)][y+1]=1;
		n[abs(x-2)][y+1]=1;
		n[x][y+2]=1;
		n[x+1][y+2]=1;
		n[x+2][y+2]=1;
		n[abs(x-1)][y+2]=1;
		n[abs(x-2)][y+2]=1;
	}
	for(int i=0;i<a;i++){
	
	for(int j=0;j<a;i++)
	if(n[i][j]==0)
	sum++;}
	cout<<sum;
}