#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)
#define rrep(i,x) for(int i=(x)-1;i>=0;--i)
#define rrep1(i,x) for(int i=(x);i>=1;--i)
#define FOR(i,a,x) for(int i=(a);i<(x);++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

template<typename T> T get(){T a;cin >> a;return a;}
template<typename T> T rev(T & a){reverse(all(a));return a;}

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int inf = 1e9;
const ll linf = 3e18;

class coord {
public:
    int x, y;
    coord(int x0, int y0){x=x0;y=y0;};
};

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

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int H, W;
    while (cin >> H >> W, H || W) {
        vector<vector<pii> > mp(H, vector<pii>(W, MP(-1, inf)));

        int s; cin >> s;

        rep1(i, s) {
            int x, y; cin >> x >> y; x--; y--;

            queue<coord> q;
            q.push(coord(x, y));
            mp[y][x] = MP(i, 0);

            while (q.size()) {
                coord crd = q.front(); q.pop();
                rep(j, 6) {
                    int ny = crd.y + dy[j], nx = crd.x + dx[crd.y % 2][j];
                    if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
                    if (mp[ny][nx].fst == i) continue;
                    if (mp[ny][nx].scd < mp[crd.y][crd.x].scd + 1) continue;
                    if (mp[ny][nx].scd == mp[crd.y][crd.x].scd + 1) {
                        mp[ny][nx].fst = -1;
                        continue;
                    }
                    mp[ny][nx] = MP(i, mp[crd.y][crd.x].scd + 1);
                    q.push(coord(nx, ny));
                }
            }
        }

        int ma = 0;

        int t; cin >> t;

        rep1(i, t) {
            vector<vector<pii> > tmp = mp;
            int x, y; cin >> x >> y; x--; y--;

            queue<coord> q;
            q.push(coord(x,y));
            mp[y][x] = MP(0, 0);

            while (q.size()) {
                coord crd = q.front(); q.pop();
                rep(j, 6) {
                    int ny = crd.y + dy[j], nx = crd.x + dx[crd.y % 2][j];
                    if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
                    if (mp[ny][nx].fst == 0) continue;
                    if (mp[ny][nx].scd < mp[crd.y][crd.x].scd + 1) continue;
                    if (mp[ny][nx].scd == mp[crd.y][crd.x].scd + 1) {
                        mp[ny][nx].fst = -1;
                        continue;
                    }
                    mp[ny][nx] = MP(0, mp[crd.y][crd.x].scd + 1);
                    q.push(coord(nx, ny));
                }
            }

            int cnt = 0;

            rep(i, H) rep(j, W) if (mp[i][j].fst == 0) cnt++;

            chmax(ma, cnt);

            mp = tmp;
        }

        cout << ma << endl;
    }
}