/* You sure that's enough source code? 
  -I'll take the best challenge you can do. ツ—ツ— Respect "El Shaddai 2010 (UTV IGNITION Entertainment)" */

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)

// Example: dx[i%2][d] ( i is 0-indexed )
const int dx[2][6] = {{ 0,-1, 1,-1,-1, 0},{ 1,-1, 0, 1, 0, 1}};
const int dy[2][6] = {{ 1, 0, 0, 1,-1,-1},{ 0, 0,-1,-1, 1, 1}};
struct NODE{
	int x;
	int y;
	int depth;
};
int W,H;

bool co(int x,int y){
	if(x<0 || y<0)return false;
	if(x>=W || y>=H)return false;
	return true;
}

int main(){
	while(cin >> W,W){
		int ret = 0;
		cin >> H;
		int memo[10][100][100];
		rep(i,10)rep(j,100)rep(k,100)memo[i][j][k] = -1;
		int s; cin >> s;
		rep(i,s){
			int x,y; cin >> x >> y;
			x--;y--;
			queue<NODE> Q; NODE t = {x,y,0};
			Q.push(t);
			while(Q.size()){
				NODE q = Q.front(); Q.pop();
				rep(d,6){
					NODE next; 
					next.x = q.x + dx[q.y%2][d];
					next.y = q.y + dy[q.y%2][d];
					next.depth = q.depth+1;
					
					if(!co(next.x,next.y) || memo[i][next.y][next.x]!=-1)continue;
					Q.push(next);
					memo[i][next.y][next.x] = next.depth;
				}
			}
			memo[i][t.y][t.x] = 0;		
		}
		int t; cin >> t;
		rep(i,t){
			bool done[100][100]={0};
			int cnt = 0;
			int x,y; cin >> x >> y;
			x--;y--;
			queue<NODE> Q; NODE t = {x,y,0};
			Q.push(t);
			while(Q.size()){
				NODE q = Q.front(); Q.pop();
				
				bool f=true;
				for(int g=0;g<s;g++){
					if( memo[g][q.y][q.x] <= q.depth){
						f=false;
					}
				}
				if(f)cnt++;
				
				rep(d,6){
					NODE next; 
					next.x = q.x + dx[q.y%2][d];
					next.y = q.y + dy[q.y%2][d];
					next.depth = q.depth +1;
					if(!co(next.x,next.y) || done[next.y][next.x])continue;
					Q.push(next);
					done[next.y][next.x] = true;
				}
			}
			ret = max(ret,cnt);
		}
		cout << ret << endl;
	}
}
	