
import Data.List

base :: Int
base = 10^9 + 7

comb :: Int -> Int -> Int
comb big small
  | small <= big-small = foo big small
  | otherwise = foo big (big-small)
  where
    foo n r = product [(n-r+1)..n] `div` product [1..r]

way :: Int -> Int -> Int -> Int
way blue red move = comb (red+1) move * comb (blue-1) (move-1)

ways :: Int -> Int -> [Int] -> [Int]
ways blue red = map (way blue red)

printList :: [Int] -> IO ()
printList ints = mapM_ putStrLn $ lines $ intercalate "\n" $ map show ints

main = do
  ls <- map read . words <$> getLine :: IO [Int]
  let total = head ls
  let blue  = last ls
  printList $ ways blue (total-blue) [1..blue]
  

