mod = 10**9 + 7
half = 5 * 10**8 + 4

n, k = map(int, input().split())
ans = [pow(half, k, mod)] * n
count = pow(2, k, mod)
rem = pow(2, k, n)
x = n
if n % 2 == 0:
    x //= 2
for i in range(n):
    r = (i + pow(2, k, n) - 1) % n
    if r % 2 == 1 and n % 2 == 0:
        ans[i] = 0
        continue
    if r % 2 == 1:
        r += n
    r //= 2
    if r % x < rem:
        ans[i] *= (count - rem) * pow(x, -1, mod) + 1
    else:
        ans[i] *= (count - rem) * pow(x, -1, mod)
for i in range(n):
    print(ans[i] % mod)