mod = 10**9+7
n, m = map(int, input().split())

for x in range(1, m + 1):
    if n <= x - 1:
        print(0)
        continue
    q, r = divmod(n - (x - 1), x)
    ans = pow(q + 2, r, mod) * pow(q + 1, x - 1 - r, mod) * q % mod
    print(ans)