mod = 10**9 + 7

n, m = map(int, input().split())
if n % 2 == 0:
    for x in range(1, m+1):
        if x == 1:
            print(n)
        else:
            print(0)
    exit()

for x in range(1, m+1):
    u, v = divmod(n, x)
    ans = pow(u, x-v, mod)*pow(u+1, v, mod)
    print(ans % mod)