MOD=10**9+7

def powmod(a,p):

  if p==0:

    return 1

  elif p==1:

    return a

  else:

    pow2=powmod(a,p//2)

    if p%2==0:

      return (pow2**2)%MOD

    else:

      return (a*pow2**2)%MOD

def invmod(a):

  return powmod(a,MOD-2)

def comb_mod(n,r):

  nPr=1

  fact_r=1

  for i in range(r):

    nPr*=n-i

    nPr%=MOD

    fact_r*=r-i

    fact_r%=MOD  

  return (nPr*invmod(fact_r))%MOD



N,K=list(map(int,input().split()))



for i in range(1,K+1):

  term1=comb_mod(N-K+1,i)

  term2=comb_mod(K-1,K-i)

  print((term1*term2%MOD))
MOD=10**9+7

N,K=list(map(int,input().split()))



def powmod(a,p):

  if p==0:

    return 1

  elif p==1:

    return a

  else:

    pow2=powmod(a,p//2)

    if p%2==0:

      return (pow2**2)%MOD

    else:

      return (a*pow2**2)%MOD

def invmod(a):

  return powmod(a,MOD-2)



term1=N-K+1

term2=1

for i in range(1,K+1):  

  #print(term1,term2)  

  print(((term1*term2)%MOD))



  term1=term1*(N-K+1-i)*invmod(i+1)%MOD

  term2=term2*(K-i)*invmod(i)%MOD
MOD = 10**9 + 7


def powmod(a, p):
    if p == 0:
        return 1
    elif p == 1:
        return a
    else:
        pow2 = powmod(a, p // 2)
        if p % 2 == 0:
            return (pow2**2) % MOD
        else:
            return (a * pow2**2) % MOD


def invmod(a):
    return powmod(a, MOD - 2)


def comb_mod(n, r):
    nPr = 1
    fact_r = 1
    for i in range(r):
        nPr *= n - i
        nPr %= MOD
        fact_r *= r - i
        fact_r %= MOD
    return (nPr * invmod(fact_r)) % MOD


N, K = list(map(int, input().split()))
for i in range(1, K + 1):
    term1 = comb_mod(N - K + 1, i)
    term2 = comb_mod(K - 1, K - i)
    print((term1 * term2 % MOD))

MOD = 10**9 + 7
N, K = list(map(int, input().split()))


def powmod(a, p):
    if p == 0:
        return 1
    elif p == 1:
        return a
    else:
        pow2 = powmod(a, p // 2)
        if p % 2 == 0:
            return (pow2**2) % MOD
        else:
            return (a * pow2**2) % MOD


def invmod(a):
    return powmod(a, MOD - 2)


term1 = N - K + 1
term2 = 1
for i in range(1, K + 1):
    # print(term1,term2)
    print(((term1 * term2) % MOD))
    term1 = term1 * (N - K + 1 - i) * invmod(i + 1) % MOD
    term2 = term2 * (K - i) * invmod(i) % MOD

+N, K = list(map(int, input().split())) -def comb_mod(n, r): -    nPr = 1 -    fact_r = 1 -    for i in range(r): -        nPr *= n - i -        nPr %= MOD -        fact_r *= r - i -        fact_r %= MOD -    return (nPr * invmod(fact_r)) % MOD - - -N, K = list(map(int, input().split())) +term1 = N - K + 1 +term2 = 1 -    term1 = comb_mod(N - K + 1, i) -    term2 = comb_mod(K - 1, K - i) -    print((term1 * term2 % MOD)) +    # print(term1,term2) +    print(((term1 * term2) % MOD)) +    term1 = term1 * (N - K + 1 - i) * invmod(i + 1) % MOD +    term2 = term2 * (K - i) * invmod(i) % MOD