#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <map>
#include <cstring>
using namespace std;

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

int m, n;
pair<int,int> bloc[100][100], tmp[100][100];

void dfs(int idx, int x, int y, int dist) {
    if (dist < bloc[y][x].second) {
        bloc[y][x] = make_pair(idx, dist);
        for (int i=0; i<6; ++i) {
            if (0 <= x+dx[y%2][i] && x+dx[y%2][i] < m &&
                0 <= y+dy[y%2][i] && y+dy[y%2][i] < n) {
                dfs(idx, x+dx[y%2][i], y+dy[y%2][i], dist+1);
            }
        }
    } else if (idx != bloc[y][x].first && dist == bloc[y][x].second) {
        bloc[y][x] = make_pair(-1, dist);
    }
}

int main() {
    while (cin >> m >> n, (m || n)) {
        for (int i=0; i<100; ++i) for (int j=0; j<100; ++j) {
            bloc[i][j] = make_pair(INT_MAX, INT_MAX);
        }
        int s;
        cin >> s;
        int x, y;
        for (int i=0; i<s; ++i) {
            cin >> x >> y;
            dfs(i, x-1, y-1, 0);
        }
        int t;
        cin >> t;
        int p, q, res = 0;
        for (int i=0; i<t; ++i) {
            cin >> p >> q;
            memcpy(tmp, bloc, sizeof bloc);
            dfs(s, p-1, q-1, 0);
            int cnt = 0;
            for (int i=0; i<n; ++i) {
                for (int j=0; j<m; ++j) {
                    if (bloc[i][j].first == s) {
                        ++ cnt;
                    }
                }
            }
            res = max(res, cnt);
            memcpy(bloc, tmp, sizeof tmp);
        }
        cout << res << endl;
    }
    return 0;
}