import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

n,k=MI()

c=pow(2,k-1,md)
inv=pow(c*2,md-2,md)
if n&1:
    r=pow(2,k-1,n)
    p=(c-r)*pow(n,md-2,md)%md
    aa=[2*p]*n
    i=1
    for _ in range(r):
        aa[i]+=1
        i=(i+2)%n
    i=n-1
    for _ in range(r):
        aa[i]+=1
        i=(i-2)%n
else:
    r=pow(2,k-1,n//2)
    p=(c-r)*pow(n//2,md-2,md)%md
    aa=[0,p*2]*(n//2)
    i=1
    for _ in range(r):
        aa[i]+=1
        i=(i+2)%n
    i=n-1
    for _ in range(r):
        aa[i]+=1
        i=(i-2)%n

for i in range(n):
    print(aa[i]*inv%md)