import Text.Printf
main :: IO()
main = do
  [n, k] <- map read . words <$> getLine
  printf "%s" $ unlines $ map show $ map (\x -> x `mod` (10^9 + 7)) $ slv n k [1..k] []
 
slv :: Integer -> Integer -> [Integer] -> [Integer] -> [Integer]
slv n k (m:ms) ret = slv n k ms (val:ret)
  where val = (comb (n - k + 1) m) * (comb (k - 1) (m - 1))
slv _ _ [] ret = reverse ret

comb :: Integer -> Integer -> Integer
comb n k = (product [1..n]) `div` ((product [1..k]) * (product [1..(n - k)])) 