#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>
using namespace std;
const int INF = 1e9;
// int dx[] = {1, 1, 0, -1, -1, 0};
// int dy[] = {0, 1, 1,  1,  0, -1};
int dx[] = {-1, 0, 1, -1, 0, 1};
int dy0[] = {0, -1, 0, 1, 1, 1};
int dy1[] = {-1, -1, -1, 0, 1, 0};
int main(){
  int m, n;
  while(cin >> m >> n, m){
    int s;
    cin >> s;
    vector<int> X(s), Y(s);
    queue<pair<size_t,size_t>> Q;
    vector<vector<int>> D(n,vector<int>(m,INF));
    for(int i = 0; i < s; ++i){
      size_t x, y;
      cin >> y >> x;
      --x,--y;
      Q.emplace(x,y);
      D[x][y] = 0;
    }
    while(Q.size()){
      size_t x, y;
      tie(x,y) = Q.front();
      Q.pop();
      int d = D[x][y];
      for(int i = 0; i < 6; ++i){
        int* dy = ((x % 2 == 0)? dy1:dy0);
        size_t x_ = x + dx[i], y_ = y + dy[i];
        if(x_ >= n or y_ >= m) continue;
        if(D[x_][y_] <= d+1) continue;
        D[x_][y_] = d+1;
        Q.emplace(x_,y_);
      }
    }
    // for(int i = 0; i < n; ++i)
    //   for(int j = 0; j < m; ++j)
    //     fprintf(stderr, "%d%c", D[i][j], j+1<m? ' ':'\n');
    int t;
    cin >> t;
    int ans = 0;
    for(int i = 0; i < t; ++i){
      size_t p, q;
      cin >> q >> p;
      --p,--q;
      // cerr << p << " " << q << "!!!" << endl;
      int ret = 0;
      queue<pair<size_t,size_t>> Q_;
      vector<vector<int>> D_ = D;
      if(D_[p][q] == 0) continue;
      D_[p][q] = 0;
      ++ret;
      Q_.emplace(p,q);
      while(Q_.size()){
        size_t x, y;
        tie(x,y) = Q_.front();
        Q_.pop();
        int d = D_[x][y];
        for(int j = 0; j < 6; ++j){
          int* dy = ((x % 2 == 0)? dy1:dy0);
          size_t x_ = x + dx[j], y_ = y + dy[j];
          if(x_ >= n or y_ >= m) continue;
          if(D_[x_][y_] <= d+1) continue;
          D_[x_][y_] = d+1;
          // cerr << x_ << " " << y_ << endl;
          ++ret;
          Q_.emplace(x_,y_);
        }
      }
      //cerr << p << " " << q << " " << ret << endl;
      ans = max(ans,ret);
    }
    cout << ans << endl;
  }
}

