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
}

Python: from collections import deque

INF = 10 ** 5
direct1 = ((-1, 0), (1, 0), (0, -1), (0, 1), (1, -1), (1, 1))
direct2 = ((-1, -1), (0, -1), (1, 0), (0, 1), (-1, 1), (-1, 0))

def search(p, mp):
  que = deque()
  que.append((0, p))
  visited = [[False] * (m + 2) for _ in range(n + 2)]
  visited[p[1]][p[0]] = True
  mp[p[1]][p[0]] = 0
  while que:
    dist, point = que.popleft()
    px, py = point
    if py % 2 == 0:
      direct = direct1
    else:
      direct = direct2
    for dx, dy in direct:
      nx, ny = px + dx, py + dy
      if not visited[ny][nx] and mp[ny][nx] != -1:
        visited[ny][nx] = True
        if mp[ny][nx] > dist + 1:
          mp[ny][nx] = dist + 1
        que.append((dist + 1, (nx, ny)))

def count(p, mp):
  que = deque()
  que.append((0, p))
  visited = [[False] * (m + 2) for _ in range(n + 2)]
  visited[p[1]][p[0]] = True
  ans = 1
  while que:
    dist, point = que.popleft()
    px, py = point
    if py % 2 == 0:
      direct = direct1
    else:
      direct = direct2
    for dx, dy in direct:
      nx, ny = px + dx, py + dy
      if not visited[ny][nx] and mp[ny][nx] != -1:
        visited[ny][nx] = True
        if mp[ny][nx] > dist + 1:
          ans += 1
        que.append((dist + 1, (nx, ny)))
  return ans


while True:
  m, n = map(int, input().split())
  if m == 0:
    break

  mp = [[-1] + [INF] * m + [-1] for _ in range(n)] 
  mp.insert(0, [-1] * (m + 2))
  mp.append([-1] * (m + 2))
  
  s = int(input())
  for _ in range(s):
    x, y = map(int, input().split())
    search((x, y), mp)
  
  ans = 0
  t = int(input())
  for _ in range(t):
    x, y = map(int, input().split())
    z = count((x, y), mp)
    ans = max(ans, z)
  
  print(ans)

Python: from collections import deque
dd0 = ((-1, -1), (0, -1), (1, 0), (0, 1), (-1, 1), (-1, 0))
dd1 = ((0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, 0))

def solve(S, p, q):
    INF = 10**9
    L = [[0]*M for i in range(N)]
    D = [[INF]*M for i in range(N)]
    que = deque()
    for i, (x, y) in enumerate(S):
        L[y][x] = 1
        D[y][x] = 0
        que.append((x, y))
    L[q][p] = 2
    D[q][p] = 0
    que.append((p, q))
    while que:
        x, y = que.popleft()
        l = L[y][x]
        d0 = D[y][x] + 1
        for dx, dy in (dd1 if y % 2 else dd0):
            nx = x + dx; ny = y + dy
            if not 0 <= nx < M or not 0 <= ny < N or D[ny][nx] < d0:
                continue
            d = D[ny][nx]
            if d == INF:
                D[ny][nx] = d0
                que.append((nx, ny))
            L[ny][nx] |= l
    res = 0
    for i in range(N):
        for j in range(M):
            if L[i][j] == 2:
                res += 1
    return res

while 1:
    M, N = map(int, input().split())
    if M == N == 0:
        break
    s = int(input())
    S = []
    for i in range(s):
        x, y = map(int, input().split())
        S.append((x-1, y-1))
    t = int(input())
    ans = 0
    for i in range(t):
        p, q = map(int, input().split())
        ans = max(ans, solve(S, p-1, q-1))
    print(ans)