#include<bits/stdc++.h>
using namespace std;
int n, m, k;
int dis[1010][1010];
int x, y;
int o, p;
void bjm(int x, int y) {
	dis[x][y] = 1;
	dis[x+1][y] = 1;
	dis[x][y+1] = 1;
	dis[x+2][y] = 1;
	dis[x][y+2] = 1;
	dis[x-1][y] = 1;
	dis[x][y-1] = 1;
	dis[x-2][y] = 1;
	dis[x][y-2] = 1;
	dis[x+1][y-1] = 1;
	dis[x-1][y+1] = 1;
	dis[x-1][y-1] = 1;
	dis[x+1][y+1] = 1;
}
void bjk(int o, int p) {
	dis[o][p] = 1;
	dis[o+1][p] = 1;
	dis[o][p+1] = 1;
	dis[o+2][p] = 1;
	dis[o][p+2] = 1;
	dis[o-1][p] = 1;
	dis[o][p-1] = 1;
	dis[o-2][p] = 1;
	dis[o][p-2] = 1;
	dis[o+1][p-1] = 1;
	dis[o-1][p+1] = 1;
	dis[o-1][p-1] = 1;
	dis[o+1][p+1] = 1;
	dis[o+2][p-1] = 1;
	dis[o-2][p+1] = 1;
	dis[o-2][p-1] = 1;
	dis[o+2][p+1] = 1;
	dis[o+2][p-2] = 1;
	dis[o-2][p+2] = 1;
	dis[o-2][p-2] = 1;
	dis[o+2][p+2] = 1;
	dis[o+1][p-2] = 1;
	dis[o-1][p+2] = 1;
	dis[o-1][p-2] = 1;
	dis[o+1][p+2] = 1;
}
int main(){
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			dis[i][j] = 0;
	while(m--) {
		cin >> x >> y;
		bjm(x, y);
	}
	while(k--) {
		cin >> o >> p;
		bjk(o, p);
	}
	int ans = 0;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if(dis[i][j] == 0) ans++;
	cout << ans << endl;
	return 0;
}