#include<bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
constexpr const int INF=1<<30,MOD=1000000007;constexpr const ll LINF=1ll<<60;
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n)for(int i=n-1;i>=0;--i)
#define REPA(i,v)REP(i,v.size())
#define all(v)(v).begin(),(v).end()
#define bit(n)(1ll<<(n))
#define uniq(v)sort(all(v));v.erase(unique(all(v)),v.end())
#define F first
#define S second
#define endl '\n'
#define cho(n,a,b)cout<<((n)?a:b)<<endl
void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}
#ifndef LOCAL
struct osd{template<class T>osd&operator<(const T&t){return*this;}template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;template<class...T>void _print(osd&a,T&&...t){}
#define cerr cer_
#endif
template<class T>ostream&operator<(ostream&o,const T&t){return o<<t;}template<class T>istream&operator>(istream&i,T&t){return i>>t;}
void _print(ostream&s){}template<class T,class...U>void _print(ostream&s,T&&t,U&&...u){s<t<(sizeof...(u)?' ':'\n');_print(s,u...);}
template<class...T>void print(T&&...t){_print(cout,t...);}template<class...T>void dprint(T&&...t){_print(cerr,t...);}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>ostream&operator<<(ostream&o,const vector<T>&v){for(auto&&i:v)o<i<' ';return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>j;return i;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<p.F<' '<p.S;}
template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>p.F>p.S;}
template<class T>ostream&operator<<(ostream&o,const set<T>&v){for(auto&&i:v)o<i<' ';return o;}
template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}
template<class T>queue<T>&operator<<(queue<T>&q,const T&t){q.push(t);return q;}template<class T>queue<T>&operator<<(T&t,queue<T>&q){t=q.front();q.pop();return q;}
template<class T>deque<T>&operator>>(const T&t,deque<T>&q){q.push_front(t);return q;}template<class T>deque<T>&operator<<(T&t,deque<T>&q){t=q.front();q.pop_front();return q;}
template<class T>deque<T>&operator<<(deque<T>&q,const T&t){q.push_back(t);return q;}template<class T>deque<T>&operator>>(deque<T>&q,T&t){t=q.back(t);q.pop_back();return q;}
template<class T>stack<T>&operator<<(stack<T>&s,const T&t){s.push(t);return s;}template<class T>stack<T>&operator>>(stack<T>&s,T&t){t=s.top();s.pop();return s;}


namespace comb{
    inline ll square(ll a){a%=MOD;return (a*a)%MOD;}
    ll pow(ll a,ll b){
        a%=MOD;
        b%=MOD-1;
        if(b==0)return 1;
        if(b==1)return a;
        if(b%2){
            return (square(pow(a,b/2)%MOD)*a)%MOD;
        }else{
            return square(pow(a,b/2)%MOD);
        }
    }

    ll fact(ll n){
        ll ans=1;
        while(n){
            ans=(ans*n--)%MOD;
        }
        return ans;
    }

    ll factto(ll a,ll b){
        ll ans=1;
        for(ll i=a;i<=b;i++){
            ans=(ans*i)%MOD;
        }
        return ans;
    }

    ll perm(ll n,ll r){ // nPr
        return factto(n-r+1,n)%MOD;
    }

    ll comb(ll n,ll r){ // nCr
        return (perm(n,r)*pow(fact(r),MOD-2))%MOD;
    }

    ll homo(ll n,ll r){ // nHr
        return comb(n+r-1,r);
    }
}


ll f(int n,int r) {
    if(r<1)return 0;
    if(n<r)return 0;
    if(r==1)return 1;
    if(n==r)return 1;
    return comb::comb(n-1,r-1);
}

int main(){
    // 通ってほしいなー
    /*
    while(1){
        int n,r;
        cin>n>r;
        cout<f(n,r)<endl;
    }//*/
    cin.tie(0);ios::sync_with_stdio(0);
    int n,k;
    cin>n>k;
    REP(i,1,k+1){
        cout<f(k,i)*comb::comb(/*n-k-(i-1)+i*/n-k+1,i)%MOD<endl;
    }
    return 0;
}


Measured memory_bytes: 256