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

const int INF = 1000000000;
typedef pair<int, int> P;

int M, N, S, T;
vector<P> a;
vector<P> b;

bool input() {
  cin >> M >> N;
  if (!M && !N) {
    return false;
  }
  cin >> S;
  a.resize(S);
  for (int i = 0; i < S; ++i) {
    cin >> a[i].first >> a[i].second;
    --a[i].first;
    --a[i].second;
  }
  cin >> T;
  b.resize(T);
  for (int i = 0; i < T; ++i) {
    cin >> b[i].first >> b[i].second;
    --b[i].first;
    --b[i].second;
  }
  return true;
}

P conv1(P p) {
  int x = p.first - (p.second/2);
  int y = p.second;
  return P(x, y);
}

P conv2(P p) {
  P q = conv1(p);
  return P(-q.second, q.first + q.second);
}

P conv3(P p) {
  P q = conv1(p);
  return P(q.first + q.second, -q.first);
}

int dist_sub(P p, P q) {
  return abs(p.first - q.first) + abs(p.second - q.second);
}

int dist(P p, P q) {
  P p1 = conv1(p);
  P p2 = conv2(p);
  P p3 = conv3(p);
  P q1 = conv1(q);
  P q2 = conv2(q);
  P q3 = conv3(q);
  int d1 = dist_sub(p1, q1);
  int d2 = dist_sub(p2, q2);
  int d3 = dist_sub(p3, q3);
  if (d1 <= d2 && d1 <= d3) {
    return d1;
  }
  if (d2 <= d3) {
    return d2;
  }
  return d3;
}

int solve() {
  int ans = -1;
  vector<P> c;
  c.resize(S + 1);
  for (int i = 0; i < S; ++i) {
    c[i] = a[i];
  }
  vector<int> counter;
  counter.resize(S + 1);
  for (int i = 0; i < T; ++i) {
    c[S] = b[i];
    for (int j = 0; j <= S; ++j) {
      counter[j] = 0;
    }
    for (int j = 0; j < M; ++j) {
      for (int k = 0; k < N; ++k) {
        bool same_flag = false;
        int min_dist = INF;
        int min_id = -1;
        for (int l = 0; l <= S; ++l) {
          int d = dist(P(j, k), c[l]);
          if (min_dist == d) {
            same_flag = true;
          } else if (min_dist > d) {
            min_dist = d;
            min_id = l;
            same_flag = false;
          }
        }
        if (!same_flag) {
          ++counter[min_id];
        }
      }
    }
    if (ans < counter[S]) {
      ans = counter[S];
    }
  }

  return ans;
}

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