import Control.Monad
import Data.Bool
import Data.List
import qualified Data.Map as M

ard i j x y = abs (x - i) + abs (y - j) + 1

path i j x y = bool b a (a < b)
  where
    a = j - i
    b = ard i j x y

allpair n = [(x, y) | x <- [1..n], y <- [(x + 1).. n]]

allpath n x y = map (\(a,b) -> (path a b x y, (a, b))) $ allpair n

cmp (a1,b1,c1) (a2,b2,c2)
  | a1 == a2 = EQ
  | a1 > a2 = GT
  | otherwise = LT

srt ps = M.fromListWith (++) [(k, [v]) | (k, v) <- ps]

srz ps xs = let g (Just x) = length x
                g Nothing = 0
             in  map (\t -> g (M.lookup t ps)) xs

showresult ps = unlines $ map show ps 

solve n x y = showresult $ srz (srt $ allpath n x y) [1..(n - 1)]

main = do
 [n, x, y] <- (map read) . words <$> getLine
 putStrLn $ solve n x y
