#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll INF=1e9+7;
const ll inf=INF*INF;
const ll MOD=1e9+7;
const ll mod=MOD;
const int MAX=1000010;
const double PI=acos(-1.0);

ll rui(ll a,ll b){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x;
        x=x*x%mod;
        b/=2;
    }
    return res;
}

signed main(){
    ll n,m;cin>>n>>m;
    REP(i,1,m+1){
        if(n==i){
            cout<<0<<endl;
            break;
        }
        if(n/i==0){
            if((i-n%i)==1){
                cout<<rui(2,n-1)<<endl;
            }
            else cout<<0<<endl;
        }
        else{
            ll ans=1;
            ll d=n/i;
            ans*=rui(d,i-n%i);
            ans=ans*rui(d+1,n%i)%mod;
            cout<<ans<<endl;
        }
    }
}