module M = Map.Make(struct type t = int * int let compare = compare end)

let rec seq a b = if a > b then [] else a :: seq (a+1) b
let (>>=) xs f = List.map f xs |> List.concat

let inc x y m =
  try M.add (x, y) (1 + M.find (x, y) m) m
  with Not_found -> M.add (x, y) 1 m

let () =
  Scanf.scanf "%d %d %d" @@ fun h w n ->
  let a = Array.init n (fun _ -> Scanf.scanf " %d %d" (fun x y -> x, y)) in
  let ret = Array.make 10 0 in
  a |> Array.fold_left (fun m1 (x, y) ->
    seq (max 1 (x-2)) (min (h-2) x) >>= (fun i -> seq (max 1 (y-2)) (min (w-2) y) >>= (fun j -> [(i, j)]))
    |> List.fold_left (fun m2 (i, j) -> inc i j m2) m1
  ) M.empty
  |> M.iter (fun (x, y) v ->
      ret.(v) <- ret.(v) + 1);
  
  let cur = Array.fold_left (+) 0 ret in
  ret.(0) <- (h-2)*(w-2) - cur;
  Array.iter (Printf.printf "%d\n") ret