#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>

using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

ll modpow(ll a, ll n, ll m){
    if(n == 0) return 1;
    ll half = modpow(a,n/2,m);
    ll res = half * half % m;
    if(n & 1) res = res * (a%m) % m;
    return res;
}

ll modinv(ll a, ll m) {
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}
//d: i-r, d+1: r

int main(){
    int n,m; cin >> n >> m;
    repr(i,1,m+1){
        if(2*i-1 > n){
            cout << 0 << endl;
        }
        else{
            int d = n/i;
            int r = n%i;
            ll ans = modpow(d,i-r,MOD);
            ans *= modpow(d+1,r,MOD);
            ans %= MOD;
            if(i-r != 1){
                ans *= modinv(d,MOD);
                ans %= MOD;
                ans *= modinv(d,MOD);
                ans %= MOD;
                ans *= d+1;
                ans %= MOD;
                ans *= d-1;
                ans %= MOD;
            }
            cout << ans << endl;
        }
    }
}