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: H, W , N = map(int,input().split())
  from bisect import bisect_left
  from bisect import bisect_right
  matrix = []
  for _ in range(N):
      x,y = map(int,input().split())
      matrix.append([x-1,y-1])
  ans = [0 for _ in range(10)]
  cand = {}
  for l in matrix:
      for x_r in [-2, -1 , 0]:
          for y_r in [-2, -1 , 0]:
              nowx = l[0] + x_r
              nowy = l[1] + y_r
              if nowx < 0 or nowy < 0 or nowx + 2>= H or nowy+ 2 >= W:
                  continue
              #ここで起点(左上)nowx, nowy として　 9マスに着目する
              name = str(nowx) + ' '  +str(nowy)
              if name in cand : cand[name] += 1
              else: cand[name] = 1
  tmp = ((H - 2) * (W - 2))
  [ans[x]+=1 for x in cand.values()]
  ans[0] -= len(cand)
  for x in ans:
      print(x)
  
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"}]