#include<cstdio>
using namespace std;
const int mod=1e9+7;
typedef long long ll;
ll A(int n,int k){
	ll ans=n%mod;
	n--;
	while(n>=k){
		ans=(ans%mod*n%mod)%mod;
		n--;
	}
	return ans%mod;
}
int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	printf("%lld\n",n-m+1);
	for(int i=2;i<=m;i++){
		ll ans;
		if(i>n-m) ans=A(m-1,m-(i-1))%mod/A(i-1,2)%mod;
		else ans=A(m-1,m-(i-1))%mod/A(i-1,2)%mod*(m-i)%mod*m%mod;
		ans%=mod;
		printf("%lld\n",ans);
	}
	return 0;
}

