import Data.Sequence
import Data.Array.ST
import Data.Array
import Data.Foldable

point_to_rect_id::Int->Int->(Int,Int)->[(Int,Int)]
point_to_rect_id h w (x,y) = [(x-i,y-j)|i<-[0,1,2],j<-[0,1,2],is_inside h w (x-i,y-j) ]

is_inside::Int->Int->(Int,Int)->Bool
is_inside h w (x,y) = ((x>=1)&&(y>=1))&&(((x+2)<=h)&&((y+2)<=w))

get_rect_id::Int->Int->[(Int,Int)]->[(Int,Int)]
get_rect_id h w xs = toList (unstableSort (fromList (concat (map (point_to_rect_id h w) xs))))

sep_counter::(Eq a)=>[a]->[Int]
sep_counter []     =  []
sep_counter (x:[])   =  1:[]
sep_counter (x:y:xs) =let h:r = sep_counter (y:xs) in
                      if x==y then  (h+1):r
                              else  1:h:r

num_count::(Int,Int)->[Int]->Array Int Int
num_count (mn,mx) xs = runSTArray $ do
                  ar<-newArray (mn,mx) 0
                  mapM (write ar) xs
                  return ar
                where write ar x = do
                              v<-readArray ar x
                              writeArray ar x (v+1)

solver::Int->Int->[(Int,Int)]->[Int]
solver h w xs = let one_nine = elems (num_count (1,9) (sep_counter (get_rect_id h w xs))) in
                (((h-2)*(w-2))-(sum one_nine)):one_nine

main::IO()
main =do
  d<-getLine
  let h:w:n:[] = map read (words d) ::[Int]
  dat<-get_dat n
  print_n (solver h w dat)

get_dat:: Int -> IO [(Int,Int)]
get_dat 0 = return []
get_dat n = do
  abc<-getLine
  let a:b:[]= map read (words abc)::[Int]
  rest<-get_dat (n-1)
  return ((a,b):rest)

print_n::[Int]->IO()
print_n [] = return ()
print_n (x:xs) =do
  print x
  print_n xs
