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 <vector>
#include <cstdio>
#include <queue>
using namespace std;

#define loop(i, n) for (int i = 0; i < n; i++)
#define INF 1010001000

typedef pair<int, int> i_i;
typedef long long int ll;

int n, m;
int dom[6] = {1, 1, 1, 0, -1, 0};
int don[6] = {-1, 0, 1, -1, 0, 1};
int dem[6] = {-1, -1, -1, 0, 1, 0};
int den[6] = {-1, 0, 1, -1, 0, 1};

int bfs(int x, int y, vector<vector<int> > &g, vector<vector<bool> > &pos);
int solve(int x,int y, vector<vector<int> > &g, vector<vector<bool> > &pos);

int main()
{
    while (cin >> n >> m, (n|m)) {
        int s, t;
        vector<vector<int> > g(n, vector<int>(m, 0));
        vector<vector<bool> > pos(n, vector<bool>(m, false));
        cin >> s;
        for (int i = 0; i < s; i++) {
            int x, y;
            cin >> x >> y;
            pos[y-1][x-1] = true;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                //cout << "===" << i << j << "===" << endl;
                g[i][j] = bfs(i, j, g, pos);
                
            }
            //cout << endl;
        }
        cin >> t;
        int ans = -INF;
        for (int i = 0; i < t; i++) {
            int x, y;
            cin >> x >> y;
            ans = max(solve(y-1, x-1, g, pos), ans);
        }
        cout << ans << endl;
    }
    return 0;
}

int solve(int x, int y, vector<vector<int> > &g, vector<vector<bool> > &pos)
{
    int ret = 0, dist = 0;
    vector<vector<bool> > ch(n, vector<bool>(m, false));
    queue<i_i> a, b, c;
    a.push(make_pair(x, y));
    while (!a.empty()) {
        while (!a.empty()) {
            i_i tmp = a.front(); a.pop();
            x = tmp.first; y = tmp.second;
            if (ch[x][y]) {
                continue;
            } else {
                ch[x][y] = true;
            }
            if (dist < g[x][y]) {
                ret++;
                for (int i = 0; i < 6; i++) {
                	if (x % 2) {
	                    int nx = x + don[i];
    	                int ny = y + dom[i];
        	            if (0 <= nx && nx < m && 0 <= ny && ny < n) {
            	            b.push(make_pair(nx, ny));
                	    }
                	} else {
	                    int nx = x + den[i];
    	                int ny = y + dem[i];
        	            if (0 <= nx && nx < m && 0 <= ny && ny < n) {
            	            b.push(make_pair(nx, ny));
                	    }                		
                	}
                }
            }
        }
        a = b;
        b = c;
        dist++;
    }
    return ret;
}

int bfs(int x, int y, vector<vector<int> > &g, vector<vector<bool> > &pos)
{
    int ret = 0;
    queue<i_i> a, b, c;
    a.push(make_pair(x, y));
    while (!a.empty()) {
        while (!a.empty()) {
            i_i tmp = a.front();
            a.pop();
            x = tmp.first;
            y = tmp.second;
            if (pos[x][y]) {
                return ret;
            } else {
                for (int i = 0; i < 6; i++) {
                	if (x % 2) {
    	                int nx = x + don[i];
        	            int ny = y + dom[i];
            	        if (0 <= nx && nx < m && 0 <= ny && ny < n) {
                	        b.push(make_pair(nx, ny));
                    	}
                	} else {
    	                int nx = x + den[i];
        	            int ny = y + dem[i];
            	        if (0 <= nx && nx < m && 0 <= ny && ny < n) {
                	        b.push(make_pair(nx, ny));
                    	}
                	}
                }
            }
        }
        ret++;
        a = b;
        b = c;
    }
    return ret;
}