def factorial_mod(n, mod):

  a = 1

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

    a *= i

    a %= mod

  return a



def comb_mod(n, k, mod):

  if k > n or k < 0:

    return 0

  fact_n = factorial_mod(n, mod)

  fact_k = factorial_mod(k, mod)

  fact_n_k = factorial_mod(n - k, mod)

  return (fact_n * pow(fact_k, mod - 2, mod) * pow(fact_n_k, mod - 2, mod)) % mod



n,k=list(map(int,input().split()))

MOD=10**9+7

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

  print(((comb_mod(n-k+1,i,MOD)*comb_mod(k-1,i-1,MOD))%MOD))

def comb(n,k,mod):

  a = 1

  b = 1

  for i in range(k):

    a = a * (n-i) % mod

    b = b * (i+1) % mod

  return a * pow(b, mod-2, mod) % mod

n,k=list(map(int,input().split()))

mod=10**9+7

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

  print(((comb(n-k+1,i,mod)*comb(k-1,i-1,mod))%mod))

def factorial_mod(n, mod):
    a = 1
    for i in range(1, n + 1):
        a *= i
        a %= mod
    return a


def comb_mod(n, k, mod):
    if k > n or k < 0:
        return 0
    fact_n = factorial_mod(n, mod)
    fact_k = factorial_mod(k, mod)
    fact_n_k = factorial_mod(n - k, mod)
    return (fact_n * pow(fact_k, mod - 2, mod) * pow(fact_n_k, mod - 2, mod)) % mod


n, k = list(map(int, input().split()))
MOD = 10**9 + 7
for i in range(1, k + 1):
    print(((comb_mod(n - k + 1, i, MOD) * comb_mod(k - 1, i - 1, MOD)) % MOD))

def comb(n, k, mod):
    a = 1
    b = 1
    for i in range(k):
        a = a * (n - i) % mod
        b = b * (i + 1) % mod
    return a * pow(b, mod - 2, mod) % mod


n, k = list(map(int, input().split()))
mod = 10**9 + 7
for i in range(1, k + 1):
    print(((comb(n - k + 1, i, mod) * comb(k - 1, i - 1, mod)) % mod))

-def factorial_mod(n, mod): +def comb(n, k, mod): -    for i in range(1, n + 1): -        a *= i -        a %= mod -    return a - - -def comb_mod(n, k, mod): -    if k > n or k < 0: -        return 0 -    fact_n = factorial_mod(n, mod) -    fact_k = factorial_mod(k, mod) -    fact_n_k = factorial_mod(n - k, mod) -    return (fact_n * pow(fact_k, mod - 2, mod) * pow(fact_n_k, mod - 2, mod)) % mod +    b = 1 +    for i in range(k): +        a = a * (n - i) % mod +        b = b * (i + 1) % mod +    return a * pow(b, mod - 2, mod) % mod -MOD = 10**9 + 7 +mod = 10**9 + 7 -    print(((comb_mod(n - k + 1, i, MOD) * comb_mod(k - 1, i - 1, MOD)) % MOD)) +    print(((comb(n - k + 1, i, mod) * comb(k - 1, i - 1, mod)) % mod))