import           Control.Monad

main = do
    s <- getLine
    let n:k:_ = map read $ words s :: [Int]
    let ans = solve n k
    forM ans $ \a -> print a

count p n
    | p == 0 = 0
    | n == 0 = 0
    | p == 1 = 1
    | n == p = 1
    | otherwise = do
        let f x = countList !! (p - 1) !! (n - x)
        sum $ map f [1..n]

countList = do
    let f x = map (count x) [0..]
    map f [0..]

solve' n k i = do
    let blue = count i k
    let c = count i (n - k)
    let red = count (i - 1) (n - k) + c * 2 + count (i + 1) (n - k)
    blue * red

solve n k = map (solve' n k) [1..k]
