-- 132 d

import Data.Int
import Data.List (sort)

md = 1000000007

mul_ :: Int64 -> Int64 -> Int64
mul_ x y = ( x * y )`mod` md

power_ :: Int64 -> Int64 -> Int64
power_ _ 0 = 1 
power_ x y = power_ (x `mul_` x) (y `div` 2) `mul_` if even y then 1 else x

div_ :: Int64 -> Int64 -> Int64
div_ x y = x `mul_` (power_ y (md - 2))

combination :: Int64 -> Int64 -> Int64
combination n 0 = 1
combination n m = (combination (n-1) (m-1)) `mul_` n `div_` m

solve :: [Int64] -> [Int64]
solve (n:k:_)  = 
    map calc [1..k]
    where
        l = n - k
        calc i = sum1 `mul_` sum2 
            where
                sum1 = combination (l + 1) i
                sum2 = combination (k  - 1) (i - 1)
    
main = interact $ unlines.(map show).solve.map read.words
