#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=2e4+7; 
ll p[N],inv[N],n,k;
ll qpow(ll a,ll b){
	ll ans=1;
	for(;b;b>>=1){
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
	}
	return ans;
}
int main(){
	cin>>n>>k;
	p[0]=inv[0]=1;
	for(int i=1;i<=n;i++) p[i]=p[i-1]*i%mod;
	inv[n]=qpow(p[n],mod-2);
	for(int i=n-1;i>=1;i--) inv[i]=inv[i+1]*(i+1)%mod;
	for(int i=1;i<=k;i++){
		if(n-k-i+1<0) cout<<0<<endl;
		else{
			ll ans=1;
			ans=ans*p[k-1]*inv[k-i]%mod*inv[i-1]%mod;
			ans=ans*p[n-k+1]%mod*inv[n-k-i+2]%mod*inv[i-1]%mod;
			cout<<ans<<endl;
		}
	}
	return 0;
}