#include <iostream>
#include <map>
#include <queue>

using namespace std;

const int e_dx[] = {0, 1, 1, 1, 0, -1};
const int e_dy[] = {-1, -1, 0, 1, 1, 0};
const int o_dx[] = {-1, 0, 1, 0, -1, -1};
const int o_dy[] = {-1, -1, 0, 1, 1, 0};;

int m, n;
int place[102][102];

class state {
public:
    int x, y;
    int cnt;
    state(int a, int b, int c) { x = a; y = b; cnt = c; }
};

void init()
{
    for (int y = 1; y <= n; y++)
        for (int x = 1; x <= m; x++)
            place[y][x] = 9;

    int s;
    cin >> s;
    for (int i = 0; i < s; i++) {
        int x, y;

        cin >> x >> y;
        place[y][x] = 0;
        state s(x, y, 0);
        queue<state> q;
        q.push(s);

        while (!q.empty()) {
            state now = q.front();
            q.pop();

            for (int i = 0; i < 6; i++) {
                int nx, ny;
                if (now.y % 2) {
                    nx = now.x + o_dx[i];
                    ny = now.y + o_dy[i];
                }
                else {
                    nx = now.x + e_dx[i];
                    ny = now.y + e_dy[i];
                }

                if (nx < 1 || nx > m || ny < 1 || ny > n)
                    continue;
                if (now.cnt + 1 < place[ny][nx]) {
                    place[ny][nx] = now.cnt + 1;
                    state tmp(nx, ny, now.cnt + 1);
                    q.push(tmp);
                }
            }
        }
    }
}


void bfs()
{
    int t;
    int ans = 0;

    cin >> t;
    while (t--) {
        int p, q;
        map<pair<int, int>, bool > ma;
        int num = 1;

        cin >> p >> q;
        state s(p, q, 0);
        queue<state> qu;
        ma[pair<int, int>(p, q)] = true;
        qu.push(s);

        while (!qu.empty()) {
            state now = qu.front();
            qu.pop();

            for (int i = 0; i < 6; i++) {
                int nx, ny;
                if (now.y % 2) {
                    nx = now.x + o_dx[i];
                    ny = now.y + o_dy[i];
                }
                else {
                    nx = now.x + e_dx[i];
                    ny = now.y + e_dy[i];
                }

                if (nx < 1 || nx > m || ny < 1 || ny > n)
                    continue;
                if (ma.count(pair<int, int>(nx, ny)) != 0)
                    continue;
                if (now.cnt + 1 < place[ny][nx]) {
                    num++;
                    state tmp(nx, ny, now.cnt + 1);
                    qu.push(tmp);
                    ma[pair<int, int>(nx, ny)] = true;
                }
            }
        }
        ans = max(ans, num);
    }
    cout << ans << endl;
}

int main()
{
    while (cin >> m >> n, m) {
        init();        
        bfs();
    }

    return 0;
}