#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
const int mod = 1e9+7;
#define ll long long
int dp[2010][2010];
int n, k;
int main()
{
	
	dp[0][0] = 1;
	for (int i = 1; i < 2010; i++)
	{
		dp[i][0] = 1;
		for (int j = 1; j < 2010; j++)
		{
			dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
			if (dp[i][j] >= mod)dp[i][j] -= mod;
		}

	}cin >> n >> k;
	for (int i = 1; i <= k; i++)
		cout << (1ll*dp[k-1][i - 1] * dp[n - k+1][i] % mod) << endl;
}