#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

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

int field[128][128], flag[128][128];

struct P{ int x, y, d; P(int x, int y, int d) : x(x), y(y), d(d) {} };

#define range(x, y) (0 <= x && x < m && 0 <= y && y < n)

int main()
{
    int m, n, s, t;
	while(cin >> m && m)
	{
		cin >> n >> s;

		memset(field, -1, sizeof field);
		
		rep(i, s)
		{
			int x, y;
			cin >> x >> y;
			
			queue<P> que;
			for(que.push(P(x - 1, y - 1, 0)); !que.empty(); que.pop())
			{
				P p = que.front();
				
				if(p.d < field[p.x][p.y] || field[p.x][p.y] == -1)
				{
					field[p.x][p.y] = p.d;
					
					rep(j, 6)
					{
						int nx = p.x + dx[p.y % 2][j], ny = p.y + dy[j];
						if(range(nx, ny)) que.push(P(nx, ny, p.d + 1));
					}
				}
			}
		}
		
		int t, res = 0;
		
		cin >> t;
		
		rep(i, t)
		{
			int x, y, sub = 0;
			cin >> x >> y;
			
			memset(flag, 0, sizeof flag);
			
			queue<P> que;
			for(que.push(P(x - 1, y - 1, 0)); !que.empty(); que.pop())
			{
				P p = que.front();
				
				if(p.d < field[p.x][p.y] && flag[p.x][p.y] == false)
				{
					flag[p.x][p.y] = true;
					
					sub++;
					
					rep(j, 6)
					{
						int nx = p.x + dx[p.y % 2][j], ny = p.y + dy[j];
						if(range(nx, ny)) que.push(P(nx, ny, p.d + 1));
					}
				}
			}
			
			chmax(res, sub);
		}
		
		cout << res << endl;
	}
}