#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=6666;
ll n,k;
ll c[N][N];
ll C(ll n,ll m)
{
    if(c[n][m]) return c[n][m];
    if(m==0||n==m) return 1;
    if(m==1) return n;
    return c[n][m]=(C(n-1,m-1)+C(n-1,m))%mod;
}
int main()
{
    scanf("%lld%lld",&n,&k);
    for(int i=1;i<=k;i++)
    {
        if(i>n-k+1)
        {
            printf("0\n");
            continue;
        }
        ll ans = 1;
        ans = C(k-1,i-1) * C(n-k+1,i) % mod;
        printf("%lld\n",ans);
    }
}
