#include<iostream>
#include<vector>
#include<queue>
#include<functional>

const int INF = 1 << 24;

struct P{
	int x, y;
};

typedef std::pair<P, int> State;

std::vector<P> getPointYouCanGo(int x, int y){
	if(y % 2 == 0){//even
			return {{x-1, y-1}, {x-1, y}, {x-1, y+1}, {x, y-1}, {x, y+1}, {x+1, y}};
	}else{//odd
		return {{x-1, y}, {x, y-1}, {x, y+1}, {x+1, y-1}, {x+1, y}, {x+1, y+1}};
	}
}

template<class T>
std::vector<T> filter(const std::vector<T> v, std::function<bool(T)> cond){
	std::vector<T> result;
	for(auto e : v){
		if(cond(e)){
			result.push_back(e);
		}
	}
	return result;
}

int map[3][100][100], m, n;

void initializeMap(int index, int default_value){
	for(int i=0;i<m;i++){
		for(int j=0;j<n;j++){
			map[index][i][j] = default_value;
		}
	}
}

void createMap(int x, int y){
	std::queue<State> sv;
	map[0][x][y] = 0;
	sv.push(std::make_pair(P{x, y}, 0));
	
	while(!sv.empty()){
		State s = sv.front(); sv.pop();
		P begin_p = s.first;
		int count = s.second;

		std::vector<P> pv = filter<P>(getPointYouCanGo(begin_p.x, begin_p.y), [](P p) -> bool{
				return 0 <= p.x && p.x < m && 0 <= p.y && p.y < n;
			});

		for(const P p : pv){
			if(map[0][p.x][p.y] == -1){
				map[0][p.x][p.y] = count + 1;
				sv.push(std::make_pair(p, count+1));
			}
		}
	}
}

void update(){
	for(int i=0;i<m;i++){
		for(int j=0;j<n;j++){
			map[1][i][j] = std::min(map[1][i][j], map[0][i][j]);
		}
	}
}

int main(){
	int s, t;

	while(std::cin >> m >> n, m){
		initializeMap(1, INF);

		std::cin >> s;
		for(int i=0;i<s;i++){
			int x, y;
			std::cin >> x >> y;
			initializeMap(0, -1);
			createMap(x-1, y-1);
			update();
		}

		int maximumBlocks = 0;
		std::cin >> t;
		for(int k=0;k<t;k++){
			int x, y, blocks = 0;
			std::cin >> x >> y;
			initializeMap(0, -1);
			createMap(x-1, y-1);
			for(int i=0;i<m;i++){
				for(int j=0;j<n;j++){
					if(map[0][i][j] < map[1][i][j]){//win
						blocks++;
					}
				}
			}
			maximumBlocks = std::max(maximumBlocks, blocks);
		}

		std::cout << maximumBlocks << std::endl;
	}
}