#include <bits/stdc++.h>
using namespace std;
#define at(t, i) get<i>(t)
typedef pair<int, int> Pr;
typedef tuple<int, int, int> Tp;
const int INF = 1 << 28;
const int dx[] = {0, -1, -1, 0, 1, 1};
const int dy[][6] = {
	{-1, 0, 1, 1, 1, 0},
	{-1, -1, 0, 1, 0, -1},
};

int m, n;
int s, t;
Pr pos[11];
int dist[11][128][128];

int solve()
{
	fill_n(**dist, 11 * 128 * 128, INF);
	for (int i = 0; i <= s; i++){
		for (int j = 0; j <= 127; j++){
			for (int k = 0; k <= 127; k++){
				if (j == 0 || k == 0 || j == 127 || k == 127){
					dist[i][j][k] = 0;
				}
			}
		}
	}
	
	for (int i = 0; i <= s; i++){
		dist[i][pos[i].first][pos[i].second] = 0;
		queue<Tp> que;
		for (que.push(Tp(pos[i].first, pos[i].second, 0)); que.size(); que.pop()){
			Tp t = que.front();
			int x = at(t, 0);
			int y = at(t, 1);
			int d = at(t, 2);
			//printf("%d %d %d\n", x, y, d);
			if (dist[i][x][y] < d) continue;
			for (int dir = 0; dir < 6; dir++){
				int nx = x + dx[dir];
				int ny = y + dy[x & 1][dir];
				if (dist[i][nx][ny] > d + 1){
					dist[i][nx][ny] = d + 1;
					que.push(Tp(nx, ny, d + 1));
				}
			}
		}
	}
	
	/*for (int i = 0; i <= s; i++){
		for (int j = 1; j <= n; j++){
			for (int k = 1; k <= m; k++){
				printf("%d ", dist[i][j][k]);
			}
			puts("");
		}
		puts("\n");
	}*/
	
	int res = 0;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			int p = 0;
			for (int k = 1; k <= s; k++){
				if (dist[p][i][j] >= dist[k][i][j]){
					p = k;
				}
			}
			if (p == 0) res++;
		}
	}
	
	return res;
}

int main()
{
	while (scanf("%d %d", &m, &n), m){
		scanf("%d", &s);
		for (int i = 0; i < s; i++){
			int x, y;
			scanf("%d %d", &x, &y);
			pos[i + 1] = Pr(y, x);
		}
		
		int res = 0;
		scanf("%d", &t);
		for (int i = 0; i < t; i++){
			int p, q;
			scanf("%d %d", &p, &q);
			pos[0] = Pr(q, p);
			res = max(res, solve());
		}
		
		printf("%d\n", res);
	}
}