{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE MultiWayIf #-}
{-# LANGUAGE NumDecimals #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}

import Control.Applicative
import Control.Arrow
import Control.Monad
import Control.Monad.ST

import Data.Char
import Data.List
import Data.Maybe

import qualified Data.ByteString.Char8 as B

import Data.Array.ST.Safe
import Data.STRef

import Debug.Trace
import Text.Printf

readInt = readLn :: IO Int
readInteger = readLn :: IO Integer
readInts = map ( fst . fromJust . B.readInt ) . B.words <$> B.getLine
readIntegers = map ( fst . fromJust . B.readInteger ) . B.words <$> B.getLine

which a b f = if f then a else b
mp [ a, b ] = ( a, b )

modifyArray a i f = writeArray a i =<< f <$> readArray a i

main = do
	[ n, x, y ] <- readInts
	mapM_ print $ solve n ( x - 1 ) ( y - 1 )

solve n x y = runST $ do
	res <- newArray ( 0, n - 2 ) 0 :: ST s ( STUArray s Int Int )
	forM_ [ 0 .. n - 1 ] $ \i -> do
		forM_ [ i + 1 .. n - 1 ] $ \j -> do
			let
				d1 = j - i
				d2 = abs ( i - x ) + abs ( j - y ) + 1
				k = min d1 d2
			modifyArray res ( k - 1 ) succ
	getElems res