#include <bits/stdc++.h>
using namespace std;

#define int long long 

const int mod = 1e9+7;

vector< vector< int > > dp(2009, vector< int > (2009,-1));

int comb(int k, int n){
	if(k < 0 || n < 0 || k > n) return 0;
	if(k == 0 || (n == k)) return 1;
	if(dp[k][n] != -1) return dp[k][n];
	return dp[k][n] = (comb(k-1,n-1)+comb(k,n-1))%mod;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n, k;
	cin >> n >> k;
	
	for(int i = 1; i <= k; i++){
		cout << comb(i-1,k-1)*comb(n-k-i+1,n-k+1)%mod << endl;
	}
}
