output_description: Print 10 lines. The (j+1)-th ( 0 \leq j \leq 9 ) line should contain the
  number of the subrectangles of size 3×3 of the grid that contains exactly j
  black cells.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      H W N
      a_1 b_1
      :
      a_N b_N
attempt: # in1 = '10 10 20'
  # in2 = ['1 1', '1 4', '1 9', '2 5', '3 10', '4 2', '4 7', '5 9', '6 4', '6 6', '6 7', '7 1', '7 3', '7 7', '8 1', '8 5', '8 10', '9 2', '10 4', '10 9']
  h, w, n = lambda: map(int, input().split())
  h, w, n = map(int, in1.split())
  
  idx1 = 0
  ab = [[0 for i in range(2)] for j in range(n)]
  while idx1 < n:
      x = input().split()
      # x = in2[idx1].split()
      ab[idx1][0] = int(x[0])
      ab[idx1][1] = int(x[1])
      idx1 += 1
  
  black_cnt = [0] * 10
  black_cnt[0] = (h - 2) * (w - 2)
  
  for idx1 in range(len(in2)):
      if ab[idx1][0] < 3:
          s = 0
      else:
          s = ab[idx1][0] - 3
      if ab[idx1][0] > h - 2:
          l = h - 2
      else:
          l = ab[idx1][0]
      Rrange = range(s, l)
      if ab[idx1][1] < 3:
          s = 0
      else:
          s = ab[idx1][1] - 3
      if ab[idx1][1] > w - 2:
          l = h - 2
      else:
          l = ab[idx1][1]
      Crange = range(s, l)
  
      for nowRow in Rrange:
          for nowCol in Crange:
              w_black = 0
              for idx2 in range(idx1):
                  if (
                      nowRow < ab[idx2][0] <= nowRow + 3
                      and nowCol < ab[idx2][1] <= nowCol + 3
                  ):
                      w_black += 1
              black_cnt[w_black] -= 1
              black_cnt[w_black + 1] += 1
  
  for idx1 in range(len(black_cnt)):
      print(black_cnt[idx1])
  
problem_description: Statement
  
  We have a grid with H rows and W columns. At first, all cells were painted
  white.
  
  Snuke painted N of these cells. The i-th ( 1 \leq i \leq N ) cell he painted
  is the cell at the a_i-th row and b_i-th column.
  
  Compute the following:
  
    * For each integer j ( 0 \leq j \leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?
samples: [{"input": "4 5 8\n    1 1\n    1 4\n    1 5\n    2 3\n    3 1\n    3 2\n    3 4\n    4 4", "output": "0\n    0\n    0\n    2\n    4\n    0\n    0\n    0\n    0\n    0\n    \n\n![](https://atcoder.jp/img/arc061/30326702be007759dce81231012a8353.png)\n\nThere are six subrectangles of size 3\u00d73. Two of them contain three black cells\neach, and the remaining four contain four black cells each.\n\n* * *"}, {"input": "10 10 20\n    1 1\n    1 4\n    1 9\n    2 5\n    3 10\n    4 2\n    4 7\n    5 9\n    6 4\n    6 6\n    6 7\n    7 1\n    7 3\n    7 7\n    8 1\n    8 5\n    8 10\n    9 2\n    10 4\n    10 9", "output": "4\n    26\n    22\n    10\n    2\n    0\n    0\n    0\n    0\n    0\n    \n\n* * *"}, {"input": "1000000000 1000000000 0", "output": "999999996000000004\n    0\n    0\n    0\n    0\n    0\n    0\n    0\n    0\n    0"}]