from math import gcd

N, K = map(int, input().split())
mod = 10 ** 9 + 7
ans = [0] * N
v = pow(2, K, mod)
g = gcd(N, 2)
Ng = N // g
r = pow(2, K, N)
q = (v - r) * pow(Ng, mod - 2, mod) % mod
now = (pow(2, K, N) - 1) % N
for i in range(N):
    if (i - now) % g == 0:
        ans[i] += q

# print(now, v, q, r)
for i in range(r):
    ans[now] += 1
    now = (now - 2) % N
# print(ans)
inv = pow(v, mod - 2, mod)
for i in range(N):
    ans[i] *= inv
    ans[i] %= mod
    print(ans[i])