#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

 
template<ll Mod>
struct ModInt{
    long long x;
    ModInt():x(0){}
    ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}
    ModInt &operator+=(const ModInt &p){
        if((x+=p.x)>=Mod) x-=Mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x+=Mod-p.x)>=Mod)x-=Mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x=(int)(1ll*x*p.x%Mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        (*this)*=p.inverse();
        return *this;
    }
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    ModInt inverse()const{
        int a=x,b=Mod,u=1,v=0,t;
        while(b>0){
            t=a/b;
            swap(a-=t*b,b);swap(u-=t*v,v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n)const{
        ModInt ret(1),mul(x);
        while(n>0){
            if(n&1) ret*=mul;
            mul*=mul;n>>=1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
    friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
    static int get_mod(){return Mod;}
};
using mint=ModInt<mod>;
 
 
template<typename Mint>
struct comcalc{
    vector<Mint> fact,finv,inv;
    int Mod;
    comcalc(int sz):fact(sz),finv(sz),inv(sz),Mod(Mint::get_mod()){
        fact[0]=Mint(1),fact[1]=Mint(1),finv[0]=Mint(1),finv[1]=Mint(1),inv[1]=Mint(1);
        for(int i=2;i<sz;i++){
            fact[i]=fact[i-1]*Mint(i);
            inv[i]=Mint(0)-inv[Mod%i]*(Mint(Mod/i));
            finv[i]=finv[i-1]*inv[i];
        }
    }
    Mint com(int n,int k){
        if(n<k) return Mint(0);
        if(n<0 or k<0) return Mint(0);
        return fact[n]*(finv[k]*finv[n-k]);
    }
    Mint fac(int n){
        return fact[n];
    }
    // 重複組み合わせ:n種類の物から重複を許し，k個選ぶ
    Mint nHk(int n,int k){
        return com(n+k-1,k);
    }
    // 玉n区別，箱k区別，各箱1個以上O(k)
    Mint F12_dis_dis_one(int n,int k){
        if(n<k)return Mint(0);
        Mint ret=0;
        for(int i=0;i<=k;i++){
            Mint add=com(k,i)*(Mint(i).pow(n));
            if((k-i)%2) ret-=add;
            else        ret+=add;
        }
        return ret;
    }
    /* sum combination(n+x, x), x=l to r
       https://www.wolframalpha.com/input/?i=sum+combination%28n%2Bx+%2Cx%29%2C+x%3Dl+to+r&lang=ja 
       check n+x < [COM_PRECALC_MAX]    */
    Mint sum_of_comb(int n,int l,int r){
        if(l>r)return Mint(0);
        Mint ret=Mint(r+1)*com(n+r+1,r+1)-Mint(l)*com(l+n,l);
        ret/=Mint(n+1);
        return ret;
    }
};
mint pow_mod(mint x,ll n){
    return x.pow(n);
}
mint inv_mod(mint x){
    return x.inverse();
}
// O(n)
mint fact_mod(ll n){
    mint ret=1;
    for(int i=2;i<=n;i++) ret*=mint(i);
    return ret;
}
// O(r)
mint comb_mod(ll n,ll r){
    if(r>n-r) r=n-r;
    if(r==0) return 1;
    mint a=1,b=mint(fact_mod(r)).inverse();
    for(int i=0;i<r;i++)a*=mint(n-i);
    return a*b;
}
int MAX_SZ=2100000;
using cominit=comcalc<mint>;


// Bは常にminを取るのが最適
signed main(){
    ll n,m;cin>>n>>m;
    for(ll x=1;x<=m;x++){
        mint res=1;

        ll a=(n+1)%x;
        ll u=(n+1)/x+1;

        ll b=x-a;
        ll v=(n+1)/x;

        ll c=0;
        ll w=(n+1)/x-1;

        if(b){
            b--;
            c++;
        }else{
            a--;
            b++;
        }

        if(a) res*=mint(u).pow(a);
        if(b) res*=mint(v).pow(b);
        if(c) res*=mint(w).pow(c);

        cout<<res<<endl;
    }

    return 0;
}