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

using namespace std;

int dx[2][6] = { {-1, 0, 1,-1,-1,0 } , {-1,0,0,1,1,1} };
int dy[2][6] = { { 0, 1, 0, 1,-1,-1} , {0,1,-1,0,1,-1} };

class P{
        public:
        int x;
        int y;
        int cost;
        P(){}
        P(int x,int y,int cost):x(x),y(y),cost(cost){}
};

int m,n,s;
int field[128][128];
int cp[128][128];
int res;

void bfs(int x,int y,int index){
        bool vis[128][128]={{0}};
        queue< P > Q;
        Q.push(P(x,y,1));
        field[x][y] = 1;
        res = 0;
        while( Q.size() ){
                P p = Q.front();Q.pop();
                for(int i = 0; i < 6; i++){
                        int nx = p.x+dx[p.y%2][i];
                        int ny = p.y+dy[p.y%2][i];
                        if(vis[p.x][p.y]++)continue;
                        if(nx < 0 || nx > m-1 || ny < 0 || ny > n-1)continue;
                        if(field[nx][ny] > p.cost+1){
                                field[nx][ny] = p.cost+1;
                                if(index == s+1){
                                        res++;
                                }
                                Q.push(P(nx,ny,p.cost+1));
                        }
                        else if(field[nx][ny] == p.cost+1){
                                field[nx][ny] = -1;
                        }
                }
        }
        return ;
}
void init(){
        for(int i = 0; i < m; i++){
                for(int j = 0; j < n; j++){
                        cp[i][j] = field[i][j];
                }
        }
}

void copy(){
        for(int i = 0; i < m; i++){
                for(int j = 0; j < n; j++){
                        field[i][j] = cp[i][j];
                }
        }
}

void output(){
        for(int i = 0; i < m; i++){
                for(int j = 0; j < n; j++){
                        printf("%3d",field[i][j]);
                }
                puts("");
        }
        return ;
}
int main(){
        while(scanf("%d",&m),m){

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

                for(int i = 0; i < 120; i++){
                        for(int j = 0; j < 120; j++){
                                field[i][j] = 99;
                        }
                }

                for(int i = 0; i < s; i++){
                        int x,y;
                        scanf("%d%d",&x,&y);
                        x--;y--;
                        //output();
                        bfs(x,y,i+1);
                }
                int t;
                scanf("%d",&t);
                init();
                int ans = -10000;
                for(int i = 0; i < t; i++){
                        int x,y;
                        scanf("%d%d",&x,&y);
                        x--;y--;
                        bfs(x,y,s+1);
                        //output();
                        ans = max(res,ans);
                        copy();
                }
                printf("%d\n",ans);
        }
        return 0;
}