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++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int INF=(1<<24);
int dy[6]={0,-1,-1,0,1,1};
int dx[2][6]={
  {-1,-1,0,1,0,-1},{-1,0,1,1,1,0}
};
int W,H,n,m,I;
int ty[100],tx[100];
int uy[100],ux[100];
int v[100][100];

queue <int> Qy;
queue <int> Qx;
queue <int> Qcnt;
queue <int> Qid;

bool input();
void init(int);
void solve();
int bfs();

int main(){
  while(input())solve();
  return 0;
}

int bfs(){
  int y,x,ny,nx,cnt,id,res=0;
  while(!Qy.empty()){
    y=Qy.front();Qy.pop();
    x=Qx.front();Qx.pop();
    cnt=Qcnt.front();Qcnt.pop();
    id=Qid.front();Qid.pop();

    if(cnt>=v[y][x])continue;
    v[y][x]=cnt;
    if(id==n+I)res++;

    for(int i=0;i<6;i++){
      ny=y+dy[i];
      nx=x+dx[y%2][i];
      if(ny<0||nx<0||ny>=H||nx>=W)continue;
	 
      Qy.push(ny);
      Qx.push(nx);
      Qcnt.push(cnt+1);
      Qid.push(id);
    
    }
  }
  return res;
}

void solve(){
  int ans=0;
  for(I=0;I<m;I++){
    init(I);
    ans=max(ans,bfs());
  }
  cout<<ans<<endl;
}

bool input(){
  cin>>W>>H;
  if(W==0&&H==0)return false;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>tx[i]>>ty[i];
  }
  cin>>m;
  for(int i=0;i<m;i++){
    cin>>ux[i]>>uy[i];
  }
  return true;
}

void init(int s){
  for(int i=0;i<100;i++){
    for(int j=0;j<100;j++){
      v[i][j]=INF;
    }
  }
  while(!Qy.empty()){
    Qy.pop();
    Qx.pop();
    Qcnt.pop();
    Qid.pop();
  }
  

  for(int i=0;i<n;i++){
    Qy.push(ty[i]);
    Qx.push(tx[i]);
    Qcnt.push(0);
    Qid.push(i);
  }
  Qy.push(uy[s]);
  Qx.push(ux[s]);
  Qcnt.push(0);
  Qid.push(n+s);
}

C++: #include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pll> pip;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-9;


int M, N, S, T;
int d[2][100][100]; // ??????, ???????¨??????¨

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

void solve(int y, int x) {
	queue<pii> que;
	fill(d[1][0], d[2][0], INF);
	
	d[1][y][x] = 0;
	que.push(pii(y, x));
	
	while (!que.empty()) {
		pii now = que.front(); que.pop();
		
		int y = now.fi, x = now.se;
		int c = d[1][y][x];
		
		REP(i, 6) {
			int xx = x + dx[y & 1][i], yy = y + dy[i];
			if (!(xx >= 0 && xx < M && yy >= 0 && yy < N)) continue;
			if (d[1][yy][xx] <= c + 1) continue;
			d[1][yy][xx] = c + 1;
			que.push(pii(yy, xx));
		}
		
	}
}

int main() {

	while (cin >> M >> N, M || N) {
		
		fill(d[0][0], d[2][0], INF);
		
		cin >> S;
		REP(i, S) {
			int x, y; scanf("%d %d", &x, &y);
			solve(y - 1, x - 1);
			REP(j, N) REP(k, M) chmin(d[0][j][k], d[1][j][k]);
		}
		
		int ans = 0;
		
		cin >> T;
		REP(i, T) {
			int x, y; scanf("%d %d", &x, &y);
			solve(y - 1, x - 1);
			
			int cnt = 0;
			REP(j, N) REP(k, M) if (d[0][j][k] > d[1][j][k]) cnt++;
			chmax(ans, cnt);
		}
		
		cout << ans << endl;
		
	}
	return 0;
}