output_description: Print K lines. The i-th line (1 \leq i \leq K) should contain the number of
  ways to arrange the N balls so that Takahashi will need exactly i moves to
  collect all the blue balls, modulo 10^9+7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: # n個からk個を選ぶ順列
  def perm(n, k):
      if n == 0:
          return 0
      else:
          result = 1
          if k != 0:
              for i in range(k):
                  result *= n - i
          return result
  
  
  # n個からk個を選ぶ組合せ
  def comb(n, k):
      if n == 0:
          return 0
      else:
          k = min(k, n - k)
          if k == 0:
              return 1
          else:
              return perm(n, k) / perm(k, k)
  
  
  # n種類からk個を選ぶ重複組合せ
  def homo(n, k):
      if n == 0:
          return 0
      else:
          return comb(n + k - 1, k)
  
  
  def main(n, k, i):
      # 青玉k個のうち、まずi箇所に1個ずつ配置
      # 残りの(k - i)個を、ゼロを許容してi箇所に配置 => i種類から(k - i)個を選ぶ重複組合せ
      result = homo(i, k - i)
      # 赤玉(n - k)個のうち、まず(i - 1)個は青玉を区切るために配置
      # 残りの(n - k - i + 1)個を、ゼロを許容して(i + 1)箇所に配置 => (i + 1)種類から(n - k - i + 1)個を選ぶ重複組合せ
      result *= homo(i + 1, n - k - i + 1)
      result = result % (10**9 + 7)
      return int(result)
  
  
  N, K = [int(x) for x in input().split()]
  for i in range(K):
      print(main(N, K, i + 1))
  
problem_description: Statement
  
  There are K blue balls and N-K red balls. The balls of the same color cannot
  be distinguished. Snuke and Takahashi are playing with these balls.
  
  First, Snuke will arrange the N balls in a row from left to right.
  
  Then, Takahashi will collect only the K blue balls. In one move, he can
  collect any number of consecutive blue balls. He will collect all the blue
  balls in the fewest moves possible.
  
  How many ways are there for Snuke to arrange the N balls in a row so that
  Takahashi will need exactly i moves to collect all the blue balls? Compute
  this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
samples: [{"input": "5 3", "output": "3\n    6\n    1\n    \n\nThere are three ways to arrange the balls so that Takahashi will need exactly\none move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B\nstands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly\ntwo moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B),\n(B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly\nthree moves: (B, R, B, R, B).\n\n* * *"}, {"input": "2000 3", "output": "1998\n    3990006\n    327341989\n    \n\nBe sure to print the numbers of arrangements modulo 10^9+7."}]