Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

var (
	direction1 = [][]int{ // 奇数段目の移動方向
		{-1, 0}, {1, 0}, {0, -1}, {0, 1}, {1, -1}, {1, 1},
	}
	direction2 = [][]int{ // 偶数段目の移動方向
		{-1, -1}, {0, -1}, {1, 0}, {0, 1}, {-1, 1}, {-1, 0},
	}
)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		m, _ := strconv.Atoi(buf[0])
		n, _ := strconv.Atoi(buf[1])
		if m == 0 && n == 0 {
			break
		}
		// initialize district_map
		/*
			district_map = [
				[-1, -1,  -1,  -1,  -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, -1,  -1,  -1,  -1]
			]
		*/
		district_map := make([][]int, n+2)
		for i := range district_map {
			district_map[i] = make([]int, m+2)
		}
		tmp1 := make([]int, m+2)
		for i := range tmp1 {
			tmp1[i] = -1
		}
		district_map[0] = tmp1
		district_map[n+1] = tmp1
		for i := 1; i < n+1; i++ {
			district_map[i] = make([]int, m+2)
			district_map[i][0] = -1
			district_map[i][m+1] = -1
			for j := 1; j < m+1; j++ {
				district_map[i][j] = INF
			}
		}

		scanner.Scan()
		s, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < s; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			x, _ := strconv.Atoi(buf_[0])
			y, _ := strconv.Atoi(buf_[1])
			Search(Point{x, y}, district_map, m, n)
		}
		ans := 0
		scanner.Scan()
		t, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < t; i++ {
			scanner.Scan()
			buf__ := strings.Split(scanner.Text(), " ")
			x, _ := strconv.Atoi(buf__[0])
			y, _ := strconv.Atoi(buf__[1])
			z := Count(Point{x, y}, district_map, m, n)
			ans = max(ans, z)
		}
		fmt.Println(ans)
	}
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

type Point struct {
	x, y int
}

type Entry struct {
	hop   int
	point Point
}

func Search(p Point, mp [][]int, m, n int) {
	que := make([]Entry, 0)
	que = append(que, Entry{0, p})
	check := make([][]bool, n+2)
	for i := range check {
		check[i] = make([]bool, m+2)
	}
	check[p.y][p.x] = true
	mp[p.y][p.x] = 0
	var direction [][]int
	for len(que) > 0 {
		tmp := que[0]
		que = que[1:]
		dist, point := tmp.hop, tmp.point
		if point.y%2 == 0 {
			direction = direction1
		} else {
			direction = direction2
		}
		for _, d := range direction {
			nx, ny := point.x+d[0], point.y+d[1]
			if !check[ny][nx] && mp[ny][nx] != -1 {
				check[ny][nx] = true
				if mp[ny][nx] > dist+1 {
					mp[ny][nx] = dist + 1
				}
				que = append(que, Entry{dist + 1, Point{nx, ny}})
			}
		}
	}
}

func Count(p Point, mp [][]int, m, n int) int {
	que := make([]Entry, 0)
	que = append(que, Entry{0, p})
	check := make([][]bool, n+2)
	for i := range check {
		check[i] = make([]bool, m+2)
	}
	check[p.y][p.x] = true
	ans := 1
	var direction [][]int
	for len(que) > 0 {
		tmp := que[0]
		que = que[1:]
		dist, point := tmp.hop, tmp.point
		if point.y%2 == 0 {
			direction = direction1
		} else {
			direction = direction2
		}
		for _, d := range direction {
			nx, ny := point.x+d[0], point.y+d[1]
			if !check[ny][nx] && mp[ny][nx] != -1 {
				check[ny][nx] = true
				if mp[ny][nx] > dist+1 {
					ans++
				}
				que = append(que, Entry{dist + 1, Point{nx, ny}})
			}
		}
	}
	return ans
}

C++: #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f

#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
  
using namespace std;
  
typedef long long ll;
  
static const double EPS = 1e-8;
  
int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};


pair<int,int> hanicam(int x,int y,int angle){
  if(y % 2 == 0){
    switch(angle){
    case 0:
      //upper left
      return pair<int,int>(x,y-1);
      break;
    case 1:
      //upper right
      return pair<int,int>(x+1,y-1);
      break;
    case 2:
      //right
      return pair<int,int>(x+1,y);
      break;
    case 3:
      //lower right
      return pair<int,int>(x+1,y+1);
      break;
    case 4:
      //lower left
      return pair<int,int>(x-1,y+1);
      break;
    case 5:
      //left
      return pair<int,int>(x-1,y);
      break;
    default:
      break;
    }
  }
  else if(y %2 != 0){
    switch(angle){
    case 0:
      //upper left
      return pair<int,int>(x,y-1);
      break;
    case 1:
      //upper right
      return pair<int,int>(x+1,y-1);
      break;
    case 2:
      //right
      return pair<int,int>(x+1,y);
      break;
    case 3:
      //lower right
      return pair<int,int>(x+1,y+1);
      break;
    case 4:
      //lower left
      return pair<int,int>(x,y+1);
      break;
    case 5:
      //left
      return pair<int,int>(x-1,y);
      break;
    default:
      break;
    }
  }
}

class State{
public:
  int x,y;
  int cost;
  int id;
  State(int _x,int _y,int _c,int _i) : x(_x),y(_y),cost(_c), id(_i) {}
  bool operator<(const State& s) const{
    return cost < s.cost;
  }
  bool operator>(const State& s) const{
    return cost > s.cost;
  }
};

int min_cost[101][101];
int id_list[101][101];
int W,H;

void bfs(int sx,int sy,int id){
  priority_queue<State,vector<State>,greater<State> > que;
  que.push(State(sx,sy,0,id));

  while(!que.empty()){
    State s = que.top();
    que.pop();
    min_cost[s.x][s.y] = s.cost;

    for(int angle=0;angle < 6;angle++){
      pair<int,int> next = hanicam(sx,sy,angle);
      int dx = next.first;
      int dy = next.second;
      if(dx < 0 || dx >= W || dy < 0 || dy >= H) continue;
      if(min_cost[dx][dy] <= s.cost + 1) continue;
      min_cost[dx][dy] = s.cost + 1;
      id_list[dx][dy] = s.id;

      que.push(State(dx,dy,s.cost + 1,s.id));
    }
  }
}

int candidate_bfs(int sx,int sy){
  int candidate_cost[101][101];
  memset(candidate_cost,0x3f,sizeof(candidate_cost));

  priority_queue<State,vector<State>,greater<State> > que;
  
  que.push(State(sx,sy,0,0));

  while(!que.empty()){
    State s = que.top();
    que.pop();
    candidate_cost[s.x][s.y] = s.cost;

    for(int angle=0;angle < 6;angle++){
      pair<int,int> next = hanicam(sx,sy,angle);
      int dx = next.first;
      int dy = next.second;
      if(dx < 0 || dx >= 100 || dy < 0 || dy >= 100) continue;
      if(min_cost[dx][dy] <= s.cost + 1) continue;
      if(candidate_cost[dx][dy] <= s.cost + 1) continue;

      que.push(State(dx,dy,s.cost + 1,s.id));
    }
  }

  int res = 0;
  for(int y=0;y<H;y++){
    for(int x=0;x<W;x++){
      if(candidate_cost[x][y] != INF){
	res++;
      }
    }
  }
  return res;
}

int main(){

  while(~scanf("%d %d",&W,&H)){
    if(W == 0 && H == 0) break;
    memset(min_cost,0x3f,sizeof(min_cost));
    memset(id_list,-1,sizeof(id_list));

    map<pair<int,int>,bool> stage;
    int total_existing_stores;
    scanf("%d",&total_existing_stores);
    for(int store_idx = 0; store_idx < total_existing_stores; store_idx++){
      int x,y;
      scanf("%d %d",&x,&y);
      x--;
      y--;
      bfs(x,y,store_idx);
    }

    int total_new_stores;

    int res = 0;
    scanf("%d",&total_new_stores);
    for(int store_idx = 0; store_idx < total_new_stores; store_idx++){
      int sx,sy;
      scanf("%d %d",&sx,&sy);

      sx--;
      sy--;
      res = max(res,candidate_bfs(sx,sy));
    }
    printf("%d\n",res);
  }
}