import java.util.*;

public class Main {
    static final int MOD = 1000000007;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 1; i <= m; i++) {
            int q = (n + 1) / i;
            int r = (n + 1) % i;
            int plus = r;
            int even = i - r - 1;
            long ans = 1;
            ans *= pow(q + 1, plus);
            ans %= MOD;
            ans *= pow(q, even);
            ans %= MOD;
            ans *= q - 1;
            ans %= MOD;
            sb.append(ans).append("\n");
        }
        System.out.print(sb);
    }
    
    static long pow(long x, long p) {
        if (p == 0) {
            return 1;
        } else if (p % 2 == 0) {
            return pow(x * x % MOD, p / 2);
        } else {
            return x * pow(x, p - 1) % MOD;
        }
    }
}