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

def f(x):
    if n < 2 * x - 1:
        return 0
    a = n // x + 1
    b = a - 1
    c = (n - x + 1) // x
    a_cnt = (n + 1) % x
    b_cnt = x - a_cnt - 1
    if a_cnt == 0:
        return pow(a, x - 1, mod) * c % mod
    return pow(a, a_cnt, mod) * pow(b, b_cnt, mod) * c % mod

for x in range(1, m + 1):
    print(f(x))