import Data.List
import Data.Int

main = do
  [n,k]<-map read.words<$>getLine
  putStr $ solve n k

solve :: Int64 -> Int64 -> String
solve n k =  unlines $ map (show.f) [1..k] where
   f i = division *% bunpai where
    division = prodm 1 (k-1) *% inv(prodm 1 (i-1) *% prodm 1 (k-i))
    bunpai = combm (n-k+1) i

mo = 10^9 + 7
a *% b = mod (a*b) mo
a ^% b = foldl (*%) 1 (replicate b a)
prodm n m = foldl (*%) 1 [n..m]
combm n r = prodm (n-r+1) n *% inv (prodm 1 r)
inv x = u where (u,_,_) = euc x mo
euc = go 1 0 0 1 where
  go u v u' v' x 0 = (u,v,x)
  go u v u' v' x y = go u' v' (u - q * u') (v - q * v') y r
    where (q,r) = quotRem x y