#include <iostream>
#include <cmath>
#include <queue>
using namespace std;

typedef pair<int, int> P;
typedef pair<int, P> S;

const int INF = 9999999;
const int MAX_M = 100, MAX_N = 100, MAX_S = 10, MAX_T = 10;

int m,n,s,t;
int dist[MAX_M][MAX_N];
int visit[MAX_M][MAX_N];
int dx[2][6] = {
    {1, 1, 1, 0, 0, 0},
    {0, 0, 0, -1, -1, -1}
};
int dy[2][6] = {
    {-1, 0, 1, 1, 0, -1},
    {-1, 0, 1, 1, 0, -1}
};

bool check(int x, int y)
{
    return (x >= 0 && x < m && y >= 0 && y < n);
}
            
int bfs(int x, int y, bool f)
{
    queue<S> que;
    que.push(S(0, P(x, y)));
    dist[y][x] = 0;
    int cover = 1;
    for(int i = 0; i < n; i++) 
        for(int j = 0; j < m; j++)
            visit[i][j] = false;

    visit[y][x] = true;
    while(!que.empty()) {
        S s = que.front(); que.pop();
        int xx = s.second.first, yy = s.second.second, step = s.first;
        for(int i = 0; i < 6; i++) {
            int nx = xx + dx[yy % 2][i], ny = yy + dy[yy % 2][i], ns = step + 1;
            if(f) {
                if(check(nx, ny) && !visit[ny][nx]) {
                    que.push(S(ns, P(nx, ny)));
                    visit[ny][nx] = true;
                    if(dist[ny][nx] > ns) 
                        cover++;
                }
            } else {
                if(check(nx, ny) && dist[ny][nx] > ns) {
                    dist[ny][nx] = ns;
                    que.push(S(ns, P(nx, ny)));
                }
            }
        }
    }
    return cover;
}

int main()
{
    while(cin >> m && m) {
        cin >> n;
        for(int i = 0; i < n; i++) 
            for(int j = 0; j < m; j++) 
                    dist[i][j] = INF;

        int x,y;
        cin >> s;
        for(int i = 0; i < s; i++) {
            cin >> x >> y;
            bfs(x, y, false);
        }
        
        cin >> t;
        int ans = 0;
        for(int i = 0; i < t; i++) {
            cin >> x >> y;
            ans = max(ans, bfs(x, y, true));
        }
        cout << ans << endl;
    }
}