{-# LANGUAGE BangPatterns #-}
import qualified Data.Map as Map
import Control.Monad
import Data.Maybe

main :: IO ()
main = do
  [h, w, n] <- map read . words <$> getLine
  points <- replicateM n $ do
    ![a, b] <- map read . words <$> getLine
    return (a, b)
  let
    ma = foldl f Map.empty points
    f m (x, y) = foldl (flip $ \c -> Map.insertWith (+) c 1) m $ filter (\(x1, y1) -> x1 > 1 && x1 < h && y1 > 1 && y1 < w) [(x+i, y+j) | i <- [-1..1], j <- [-1..1]]
    ans = Map.foldl (\m i -> Map.insertWith (+) i 1 m) Map.empty ma
    l = sum ans
  forM_ [0..9] $ \i -> print $ ma
