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-1], y <- [(x + 1).. n]]

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

srz ps n = let m = group $ sort ps
           in modlist m 1 n

modlist [] i n 
     | i < n = replicate (n - i) 0
     | otherwise = []
modlist t@(x:xs) i n = let d = head x
                           ln = length x
                         in if i == n + 1 
                              then []
                              else if d > i 
                                  then (replicate (d - i) 0) ++ modlist t d n
                                  else ln : modlist xs (i + 1) n

solve n x y = unlines $ map show $ srz (allpath n x y) n

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