import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())


N,M = MI()
mod = 10**9+7

for X in range(1,M+1):
    if X == 1:
        print(N)
        continue
    if N < 2*X-1:
        print(0)
    else:
        ans = (N-(X-1))//X
        a = (N+2)//X
        b = (N+X)//X
        i = (-N) % X
        if i == 0:
            ans *= pow(a,X-2,mod)*b
        elif i == 1 or i == 2:
            ans *= pow(a,X-1,mod)
        else:
            ans *= pow(a,i-2,mod)*pow(b,(X-1)-(i-2),mod)
        ans %= mod
        print(ans)

# (N-(X-1))//X,(N+2)//X,(N+3)//X,…,(N+(X-1))//X,(N+X)//X の積