#include<cstdio>
#include<algorithm>
#include<queue>

using namespace std;
const int dy[2][6]={{1,-1,-1,0,-1,0},{1,-1,1,0,0,1}};
const int dx[2][6]={{0,0,1,1,-1,-1},{0,0,1,1,-1,-1}};
class P{
        public:
        int x;
        int y;
        int cost;
        int index;
        P(){}
        P(int x,int y,int cost,int index):x(x),y(y),cost(cost),index(index){}
};

class Data{
        public:
        int cost;
        int index;
        Data(){}
        Data(int cost,int index):cost(cost),index(index){}
};

int main(){
        int m,n;
        while(scanf("%d",&m),m){

                scanf("%d",&n);
                int s;
                scanf("%d",&s);

                queue< P > Q;
                int sx[100];
                int sy[100];
                for(int i = 0; i < s; i++){
                        scanf("%d%d",&sx[i],&sy[i]);
                }

                int t;
                scanf("%d",&t);
                int ans = -11000;
                for(int q = 0; q < t; q++){
                        int x,y;
                        Data vis[128][128];
                        queue< P > Q;

                        for(int i = 0; i < 120; i++){
                                for(int j = 0; j < 120; j++){
                                        vis[i][j] = Data(0,0);
                                }
                        }
                        for(int i = 0; i < s; i++){
                                Q.push(P(sx[i]-1,sy[i]-1,1,i+1));
                                vis[sx[i]-1][sy[i]-1]=Data(1,i+1);
                        }
                        scanf("%d%d",&x,&y);
                        Q.push(P(x-1,y-1,1,s+1));
                        vis[x-1][y-1]=Data(1,s+1);
                        while( Q.size() ){
                                P p = Q.front();Q.pop();
                                if(vis[p.x][p.y].cost==-1)continue;
                                for(int i = 0; i < 6; i++){
                                        if(p.x+dx[p.y%2][i] < 0 || p.x+dx[p.y%2][i] > m || p.y+dy[p.y%2][i] < 0 || p.y+dy[p.y%2][i] > n)continue;
                                        if(vis[p.x+dx[p.y%2][i]][p.y+dy[p.y%2][i]].cost == p.cost+1){
                                                vis[p.x+dx[p.y%2][i]][p.y+dy[p.y%2][i]].cost = -1;
                                                continue;
                                        }
                                        if(vis[p.x+dx[p.y%2][i]][p.y+dy[p.y%2][i]].cost != 0)continue;
                                        Q.push(P(p.x+dx[p.y%2][i],p.y+dy[p.y%2][i],p.cost+1,p.index));
                                        vis[p.x+dx[p.y%2][i]][p.y+dy[p.y%2][i]] = Data(p.cost+1,p.index);
                                }

                        }
                        int res = 0;
                        for(int i = 0; i < m; i++){
                                for(int j = 0; j < n; j++){
                                        if(vis[i][j].index == s+1 && vis[i][j].cost != -1)res++;
                                }
                        }
                        ans = max(ans,res);
                }
                printf("%d\n",ans);
        }
        return 0;
}