{-# LANGUAGE Strict #-}

main :: IO ()
main = do
  [n, x, y] <- map read . words <$> getLine
  putStr . unlines . map show $ solve n x y

solve :: Int -> Int -> Int -> [Int]
solve n x y = map f [1 .. n - 1]
  where f k = length $ filter (\(i, j) -> g i j == k) [(i, j) | i <- [1 .. n - 1]
                                                              , j <- [i + 1 .. n]]
        g i j = minimum [ j - i
                        , abs (x - i) + 1 + abs (y - j)
                        , abs (y - i) + 1 + abs (x - j)]
