#include<iostream>
#include<queue>
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;//x, y
typedef pair<int, pii> piii;//cost, x, y
int dx[2][6] = {
  {0, 1, 0, -1, -1, -1},
  {1, 1, 1,  0, -1,  0}
};
int dy[2][6] = {
  {-1, 0, 1, 1, 0, -1},
  {-1, 0, 1, 1, 0, -1}
};
int grid[110][110];
int n, m, a;

int bfs(int grid[110][110], int sx, int sy){
  queue<piii> que;
  int ans = 1;
  grid[sy][sx] = 0;
  que.push(mp(0, mp(sx, sy)));
  while(!que.empty()){
    piii p = que.front();que.pop();
    int cost = p.first;
    int x    = p.second.first;
    int y    = p.second.second;
    for (int i = 0; i < 6; i++) {
      int nx = x + dx[y&1][i], ny = y + dy[y&1][i];
      if(0 <= ny && ny < n &&
         0 <= nx && nx < m &&
         grid[ny][nx] > cost + 1){
        ans++;
        grid[ny][nx] = cost + 1;
        que.push(mp(cost + 1, mp(nx, ny)));
      }
    }
  }
  // for (int i = 0; i < n; i++) {
  //   for (int j = 0; j < m; j++) {
  //     std::cout << grid[i][j] << " ";
  //   }
  //   std::cout << std::endl;
  // }
  // std::cout << std::endl;

  return ans;
}

int main(int argc, char *argv[]){
  while(cin >> m >> n, n){
    int ans = 0, t;
    cin >> a;
    int sx[a], sy[a];
    for (int i = 0; i < a; i++) {
      cin >> sx[i] >> sy[i];
      sx[i]--;sy[i]--;
    }
    cin >> t;
    int px[t], py[t];
    for (int i = 0; i < t; i++) {
      cin >> px[i] >> py[i];
      px[i]--;py[i]--;
    }
    
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        grid[i][j] = 1e8;
      }
    }
    
    for (int i = 0; i < a; i++) {
      bfs(grid, sx[i], sy[i]);
    }

    for (int i = 0; i < t; i++) {
      int tmp[110][110];
      
      for (int j = 0; j < n; j++) {
        for (int k = 0; k < m; k++) {
          tmp[j][k] = grid[j][k];
        }
      }
      
      ans = max(ans, bfs(tmp, px[i], py[i]));
    }
    std::cout << ans << std::endl;
  }
  return 0;
}