#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=2010,mod=1e9+7;
#define inf 0x7fffffff
ll c[N-5][N-5];

int main()
{
    ll n,k;
    scanf("%lld%lld",&n,&k);
    for(ll i=0;i<=n;i++)
    {
        c[i][0]=1;
        for(ll j=1;j<=i;j++)
            c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
    }
    for(ll i=1;i<=k;i++)
    {
        printf("%lld\n",(c[k-1][i-1]*c[n-k+1][i])%mod);
    }
    return 0;
}
