#include<iostream>
#include<cstring>
#include<queue>

using namespace std;

typedef pair<int,int> P;

int fie[101][101];
int cox[11],coy[11];
int conx[11],cony[11];
int m,n,s,sn;
int ans=0;
const int dx1[6]={-1,-1,-1,0,1,0};
const int dx2[6]={0,-1,0,1,1,1};
const int dy[6]={-1,0,1,-1,0,1};
const int INF=100000;

void bfs(int x,int y){
	queue<P> que;
	que.push(P(x,y));
	fie[x][y]=0;
	while(que.size()){
		P p=que.front();que.pop();
		int kx=p.first,ky=p.second;
		for(int i=0;i<6;i++){
			int fx=kx,fy=ky+dy[i];
			if(ky%2==1)fx+=dx1[i];
			if(ky%2==0)fx+=dx2[i];
			if(fx>=1 && fx<=m && fy>=1 && fy<=n){
				if(fie[fx][fy]>fie[kx][ky]+1){
					que.push(P(fx,fy));
					fie[fx][fy]=fie[kx][ky]+1;
				}
			}
		}
	}
}

int bfs2(int x,int y,int fie2[101][101]){
	int res=1;
	queue<P> que;
	que.push(P(x,y));
	fie2[x][y]=0;
	while(que.size()){
		P p=que.front();que.pop();
		int kx=p.first,ky=p.second;
		for(int i=0;i<6;i++){
			int fx=kx,fy=ky+dy[i];
			if(ky%2==1)fx+=dx1[i];
			if(ky%2==0)fx+=dx2[i];
			if(fx>=1 && fx<=m && fy>=1 && fy<=n){
				if(fie2[fx][fy]>fie2[kx][ky]+1){
					que.push(P(fx,fy));
					fie2[fx][fy]=fie2[kx][ky]+1;
					res++;
				}
			}
		}
	}
	return res;
}

int main(void){
	while(1){
		scanf("%d",&m);
		if(m==0)break;
		scanf("%d",&n);
		for(int i=0;i<=100;i++){
			for(int j=0;j<=100;j++){
				fie[i][j]=INF;
			}
		}
		ans=0;
		scanf("%d",&s);
		for(int i=0;i<s;i++){
			scanf("%d%d",&cox[i],&coy[i]);
			bfs(cox[i],coy[i]);
		}
		scanf("%d",&sn);
		for(int i=0;i<sn;i++){
			scanf("%d%d",&conx[i],&cony[i]);
			ans=max(ans,bfs2(conx[i],cony[i],fie));
		}
		printf("%d\n",ans);
	}
    return 0;
}