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 <bits/stdc++.h>
using namespace std;

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

int n, m;
int g[200][200];
int grid[200][200];
int grid2[200][200];

bool ok(int i, int j)
{
	return i >= 0 && j >= 0 && i < n && j < m;
}

int solve()
{
	int maxi = 0;
	memcpy(grid, g, sizeof(g));
	for (int a = 0; a < 200; a++){
		memset(grid2, 0, sizeof(grid2));
		for (int i = 0; i < n; i++){
			for (int j = 0; j < m; j++){
				for (int dir = 0; dir < 7; dir++){
					int nx = i + dx[dir];
					int ny = j + dy[i % 2][dir];
					if (!ok(nx, ny)) continue;
					grid2[nx][ny] |= grid[i][j];
				}
			}
		}
		
		int cnt = 0;
		for (int i = 0; i < n; i++){
			for (int j = 0; j < m; j++){
				if (grid2[i][j] == (grid2[i][j] & (-grid2[i][j]))){
					grid[i][j] = grid2[i][j];
					if (grid[i][j] == 1) cnt++;
				}
				//printf("%d ", grid[i][j]);
			}
			//puts("");
		}
		maxi = max(maxi, cnt);
	}
	return maxi;
}

int main()
{
	while (scanf("%d %d", &m, &n), m){
		memset(g, 0, sizeof(g));
		int maxi = 0;
		int s;
		scanf("%d", &s);
		for (int i = 0; i < s; i++){
			int x, y;
			scanf("%d %d", &x, &y);
			g[--x][--y] = 1 << i + 1;
		}
		int t;
		scanf("%d", &t);
		for (int i = 0; i < t; i++){
			int p, q;
			scanf("%d %d", &p, &q);
			if (g[--p][--q]) continue;
			g[p][q] = 1;
			int tmp = solve();
			maxi = max(maxi, tmp);
			g[p][q] = 0;
		}
		printf("%d\n", maxi);
	}
	
	return 0;
}

C++: /* You sure that's enough source code? 
  -I'll take the best challenge you can do. ツ—ツ— Respect "El Shaddai 2010 (UTV IGNITION Entertainment)" */

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)

// Example: dx[i%2][d] ( i is 0-indexed )
const int dx[2][6] = {{ 0,-1, 1,-1,-1, 0},{ 1,-1, 0, 1, 0, 1}};
const int dy[2][6] = {{ 1, 0, 0, 1,-1,-1},{ 0, 0,-1,-1, 1, 1}};
struct NODE{
	int x;
	int y;
	int depth;
};
int W,H;

bool co(int x,int y){
	if(x<0 || y<0)return false;
	if(x>=W || y>=H)return false;
	return true;
}

int main(){
	while(cin >> W,W){
		int ret = 0;
		cin >> H;
		int memo[10][100][100];
		rep(i,10)rep(j,100)rep(k,100)memo[i][j][k] = -1;
		int s; cin >> s;
		rep(i,s){
			int x,y; cin >> x >> y;
			x--;y--;
			queue<NODE> Q; NODE t = {x,y,0};
			Q.push(t);
			while(Q.size()){
				NODE q = Q.front(); Q.pop();
				rep(d,6){
					NODE next; 
					next.x = q.x + dx[q.y%2][d];
					next.y = q.y + dy[q.y%2][d];
					next.depth = q.depth+1;
					
					if(!co(next.x,next.y) || memo[i][next.y][next.x]!=-1)continue;
					Q.push(next);
					memo[i][next.y][next.x] = next.depth;
				}
			}
			memo[i][t.y][t.x] = 0;		
		}
		int t; cin >> t;
		rep(i,t){
			bool done[100][100]={0};
			int cnt = 0;
			int x,y; cin >> x >> y;
			x--;y--;
			queue<NODE> Q; NODE t = {x,y,0};
			Q.push(t);
			while(Q.size()){
				NODE q = Q.front(); Q.pop();
				
				bool f=true;
				for(int g=0;g<s;g++){
					if( memo[g][q.y][q.x] <= q.depth){
						f=false;
					}
				}
				if(f)cnt++;
				
				rep(d,6){
					NODE next; 
					next.x = q.x + dx[q.y%2][d];
					next.y = q.y + dy[q.y%2][d];
					next.depth = q.depth +1;
					if(!co(next.x,next.y) || done[next.y][next.x])continue;
					Q.push(next);
					done[next.y][next.x] = true;
				}
			}
			ret = max(ret,cnt);
		}
		cout << ret << endl;
	}
}