let id x = x

let init n f =
  let rec g i ns = if i = 0 then 0 :: ns else g (i - 1) (i :: ns) in
  List.map f (g (n - 1) [])

let (n, x, y) = Scanf.scanf "%d %d %d" @@ fun n x y -> (n, x, y)

let ix = init n (fun i -> i + 1)

let pair = List.flatten @@ fst @@ List.fold_left (fun (ns, ys) i -> ((List.map (fun j -> (i, j)) ys)::ns, List.tl ys)) ([], ix) ix

let f (i, j) = 
  let rec min' m = function
    | [] -> m
    | x :: xs -> min' (min m x) xs 
  in
  min' max_int [(abs (i - j)); (abs (i - y)) + 1 + (abs (x - j)); (abs (i - x)) + 1 + (abs (y - j))]

let g xs i =
  match xs with
    | [] -> [(i, 1)]
    | (j, c) :: xs -> if i = j then (j, c + 1) :: xs else (i, 1) :: (j, c) :: xs

let () = 
  let cs = pair 
    |> List.map f
    |> List.fast_sort (fun i j -> i - j)
    |> List.fold_left g [] in
  List.iter (fun k ->
    try Printf.printf "%d\n" (List.assoc k cs)
    with Not_found -> print_endline "0"
  ) (init (n - 1) (fun i -> i + 1))
