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: import sys
  
  iH, iW, iN = [int(_) for _ in input().split()]
  aD = [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]
  
  iMax = (iH - 2) * (iW - 2)
  # print (iMax)
  
  dC = {}
  for i in range(10):
      dC[i] = 0
  
  # 愚直 無理 つらい
  # for i in range(1,iH -1):
  #   for j in range(1,iW-1):
  #       tmp = 0
  #       for a in aD:
  #           if j<= a[1] <=j+2 and i<= a[0] <= i+2:
  #               tmp +=1
  #       dC[tmp] +=1
  dM = {}
  for a in aD:
      y = a[0]
      x = a[1]
      for aP in [
          (y - 2, x - 2),
          (y - 2, x - 1),
          (y - 2, x),
          (y - 1, x - 2),
          (y - 1, x - 1),
          (y - 1, x),
          (y, x - 2),
          (y, x - 1),
          (y, x),
      ]:
          if 0 < aP[0] < iH - 1 and 0 < aP[1] < iW - 1:
              iP = aP[0] * iW + aP[1]
              if iP in dM:
                  dM[iP] += 1
              else:
                  dM[iP] = 1
  for i in dM:
      dC[dM[i]] += 1
  
  iAllBM = 0
  for i in range(1, 10):
      iAllBM += dC[i]
  dC[0] = iMax - iAllBM
  
  for i in range(10):
      print(dC[i])
  
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"}]