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

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
typedef pair<int, int> P;
void bfs(int sx, int sy, int d[111][111]){
  const int W = 110;
  const int H = 110;
  REP(y, H) REP(x, W) d[y][x] = INF;
  queue<int> qx, qy;
  qx.push(sx); qy.push(sy);
  d[sy][sx] = 0;
  while(!qx.empty()){
    int x = qx.front(); qx.pop();
    int y = qy.front(); qy.pop();
    if(y % 2 == 0){
      int dx[6] = {-1, 0, 1, 0, -1, -1};
      int dy[6] = {-1, -1, 0, 1, 1, 0};
      REP(r, 6) {
        int nx = x + dx[r];
        int ny = y + dy[r];
        if(valid(nx, ny, W, H) && d[ny][nx] > d[y][x] + 1){
          d[ny][nx] = d[y][x] + 1;
          qx.push(nx); qy.push(ny);
        }
      }
    }else{
      int dx[6] = {0, 1, 1, 1, 0, -1};
      int dy[6] = {-1, -1, 0, 1, 1, 0};
      REP(r, 6) {
        int nx = x + dx[r];
        int ny = y + dy[r];
        if(valid(nx, ny, W, H) && d[ny][nx] > d[y][x] + 1){
          d[ny][nx] = d[y][x] + 1;
          qx.push(nx); qy.push(ny);
        }
      }
    }
  }
}

int main(){
  int W, H;
  while(cin >> W >> H && W){
    int N;
    int tx[10], ty[10];
    cin >> N;
    REP(i, N) cin >> tx[i] >> ty[i];
    int dist[11][111][111];
    REP(i, N){
      bfs(tx[i], ty[i], dist[i]);
    }
    int ans = 0;
    int M; cin >> M;
    REP(i, M){
      int nx, ny; cin >> nx >> ny;
      bfs(nx, ny, dist[N]);
      int cnt = 0;
      REP(y, H)REP(x, W){
        bool ok = true;
        REP(j, N) if(dist[N][y][x] >= dist[j][y][x]) ok = false;
        if(ok) cnt++;
      }
      ans = max(ans, cnt);
    }
    cout << ans << endl;
  }
  return 0;
}