import qualified Data.Vector as V
import qualified Data.Vector.Unboxed as VU
import qualified Data.Vector.Unboxed.Mutable as VUM
import qualified Data.ByteString.Char8 as B
import qualified Data.Map as MP
import qualified Data.Set as ST
import qualified Data.Sequence as SQ
import Data.Array
import Data.Array.ST
import Data.Array.IO
import Data.Maybe
import Data.Ratio
import Data.Char
import Data.Bits
import Data.List
import Data.Tuple
import Data.Functor
import Data.IORef
import Data.STRef
import Control.Applicative
import Control.Monad
import Control.Monad.ST
import Debug.Trace

type Graph = V.Vector [(Int,Int)]
type Distance = VUM.IOVector Int
type Queue = ST.Set (Int, Int)
 
buildGraph :: V.Vector (Int, (Int, Int)) -> Int -> Graph
buildGraph xs n = V.accumulate step (V.replicate n []) xs
  where
    step xs v = v:xs
 
dijkstra :: Int -> Int -> Graph -> IO Distance
dijkstra vertex from graph = do
  distance <- VUM.replicate vertex (10^9) :: IO Distance
  VUM.write distance from 0 
  trav graph distance (ST.singleton (0, from))
  where
    trav :: Graph -> Distance -> Queue -> IO Distance
    trav graph distance queue
      | ST.null queue = return distance
      | otherwise = do
          tmp <- VUM.read distance from
          case compare acc tmp of
            LT -> update from acc distance queue' >>= trav graph distance
            EQ -> update from acc distance queue' >>= trav graph distance
            GT -> trav graph distance queue'
        where
          ((acc, from), queue') = ST.deleteFindMin queue
 
    update :: Int -> Int -> Distance -> Queue -> IO Queue
    update f a dist q = update' a dist (graph V.! f) q

    update' :: Int -> Distance -> [(Int, Int)] -> Queue -> IO Queue
    update' _ _ [] q = return q
    update' a dist ((to, cost):xs) q = do
      tmp <- VUM.read dist to
      case compare a' tmp of
          LT -> do
            VUM.write dist to a'
            update' a dist xs (ST.insert (a', to) q)
          _ ->
            update' a dist xs q
      where
        a' = a + cost
  
main = do
  [n,x,y] <- map read . words <$> getLine :: IO [Int]

  let
    base = zip [0..n-2] [1..n-1]
    vs = [(x-1,y-1), (y-1,x-1)] ++ ((map swap base) ++ base)
    vs' = map (\(a,b) -> (a,(b,1))) vs
    graph = buildGraph (V.fromList vs') n

  table <- VUM.replicate n 0 :: IO (VUM.IOVector Int)

  forM_ [0..n-1] $ \i -> do
    distance <- dijkstra n i graph
    forM_ [i+1..n-1] $ \j -> do
      VUM.read distance j >>= \r -> 
        VUM.modify table (+1) r
  
  forM_ [1..n-1] $ \i -> do 
    VUM.read table i >>= print