#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;

long long powMod(long long x, long long n, long long mod) {
    long long res = 1LL;
    while(n > 0) {
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n = n >> 1;
    }
    return res;
}

long long solve(int n, int m, int x) {
    if(n < 2 * x - 1) return 0;
    int v = (n + x - 1) / x;
    int a = n % x;
    if(!a) a = x;
    long long ans = powMod(v, a, mod) * powMod(v - 1, x - a, mod) % mod;
    return ans;
}

int main() {
    int n, m;
    cin >> n >> m;
    for(int x = 1; x <= m; ++x) {
        cout << solve(n, m, x) << '\n';
    }
}