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: # -*- coding: utf-8 -*-
  MOD = 10**9 + 7
  
  
  class BiCoeff(object):
      def __init__(self, MAX, m):
          super(BiCoeff, self).__init__()
          fac = [0] * MAX
          finv = [0] * MAX
          inv = [0] * MAX
  
          fac[0] = 1
          fac[1] = 1
          finv[0] = 1
          finv[1] = 1
          inv[1] = 1
          for i in range(2, MAX):
              fac[i] = (fac[i - 1] * i) % m
              inv[i] = m - (inv[m % i] * (m // i)) % m
              finv[i] = (finv[i - 1] * inv[i]) % m
  
          self.MAX = MAX
          self.m = m
          self.fac = fac
          self.finv = finv
          self.inv = inv
  
      def calc(self, n, k):
          if n < k:
              return 0
          if n < 0 or k < 0:
              return 0
          return (self.fac[n] * (self.finv[k] * self.finv[n - k]) % self.m) % self.m
  
  
  bi = BiCoeff(2001, MOD)
  
  n, k = map(int, input().split())
  
  for i in range(1, k + 1):
      a = (bi.calc(n - k + 1, i) * bi.calc(k - 1, i - 1)) % MOD
      print(a)
  
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."}]