#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
#define chmin(a, b) ((a) = min((a), (b)))
#define chmax(a, b) ((a) = max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;

int dyo[] = {0, -1, -1, 0, 1, 1};
int dxo[] = {1, 1, 0, -1, 0, 1};

int dye[] = {0, -1, -1, 0, 1, 1};
int dxe[] = {1, 0, -1, -1, -1, 0};

int main(){
    while(1){
        int m, n; cin>>m>>n;
        if(m == 0) return 0;
        int s; cin>>s;
        vector<int> x(s), y(s);
        vector<vector<int>> dist(n, vector<int>(m, 1e9));
        queue<T> que;
        for(int i=0; i<s; i++){
            cin>>x[i]>>y[i];
            x[i]--;
            y[i]--;
            dist[y[i]][x[i]] = 0;
            que.emplace(y[i], x[i], 0);
        }

        while(que.size()){
            int cy, cx, cnt;
            tie(cy, cx, cnt) = que.front();
            que.pop();

            for(int i=0; i<6; i++){
                int ny, nx;
                if(cy % 2 == 0){
                    ny = cy + dye[i];
                    nx = cx + dxe[i];
                }
                else{
                    ny = cy + dyo[i];
                    nx = cx + dxo[i];
                }

                if(0 <= ny && ny < n && 0 <= nx && nx < m){

                    if(cnt + 1 < dist[ny][nx]){
                        dist[ny][nx] = cnt + 1;
                        que.emplace(ny, nx, cnt + 1);
                    }
                }
            }
        }

        int t; cin>>t;
        int ans = 0;
        for(int i=0; i<t; i++){
            int p, q; cin>>p>>q;
            p--;
            q--;

            int sum = 0;
            vector<vector<int>> cdist(n, vector<int>(m, 1e9));
            cdist[q][p] = 0;
            que.emplace(q, p, 0);
            while(que.size()){
                int cy, cx, cnt;
                tie(cy, cx, cnt) = que.front();
                que.pop();

                for(int j=0; j<6; j++){
                    int ny, nx;
                    if(cy % 2 == 0){
                        ny = cy + dye[j];
                        nx = cx + dxe[j];
                    }
                    else{
                        ny = cy + dyo[j];
                        nx = cx + dxo[j];
                    }


                    if(0 <= ny && ny < n && 0 <= nx && nx < m){
                        if(cnt + 1 < cdist[ny][nx]){
                            cdist[ny][nx] = cnt + 1;
                            //if(dist[ny][nx] <= cdist[ny][nx]) continue;
                            que.emplace(ny, nx, cnt + 1);
                        }
                    }
                }
            }

            for(int j=0; j<n; j++){
                for(int k=0; k<m; k++){
                    if(cdist[j][k] < dist[j][k]){
                        sum++;
                    }
                }
            }

            ans = max(ans, sum);
        
        }

        

        cout << ans << endl;
    }
}
