#include<bits/stdc++.h>
using namespace std;
long long n, m, k, ans, a, b;
bool x[10001][10001];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> k;
	ans = n * n;
	for (int i = 1; i <= m; i++) {
		cin >> a >> b;
		for (int j = a - 2; j <= a + 2; j++) {
			if (x[j][b] == 0 && j > 0 && b > 0)x[j][b] = 1, ans--;
		}
		for (int j = b - 2; j <= b + 2; j++) {
			if (x[a][j] == 0 && j > 0)x[a][j] = 1, ans--;
		}
		for (int j = a - 1; j <= a + 1; j++) {
			for (int z = b - 1; z <= b + 1; z++) {
				if (x[j][z] == 0 && j > 0 && z > 0)x[j][z] = 1, ans--;
			}
		}
	}
	for (int i = 1; i <= k; i++) {
		cin >> a >> b;
		for (int j = a - 2; j <= a + 2; j++) {
			for (int z = b - 2; z <= b + 2; z++) {
				if (x[j][z] == 0 && j > 0 && z > 0)x[j][z] = 1, ans--;
			}
		}
	}
	cout << ans;
	return 0;
}

求调