#include <iostream>
#include <cstdio>
#include <set>
#include<cmath>
#include<math.h>
#include<math.h>
#include<map>
#include<queue>
#include<string>
#include<stack>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
long long int C[2005][2005],n,k,mod=1e9+7;
int main()
{
	C[0][0] = 1;
	for (int i = 1; i < 2005; i++)
	{
		C[i][0] = 1;
		C[i][i] = 1;
	}
	for(int i=1;i<2005;i++)
		for (int j = 1; j <= i; j++) 
		{
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
		}
	scanf("%lld%lld", &n, &k);
	for (int i = 1; i <= k; i++)
	{
		printf("%lld\n", C[n - k + 1][i] * C[k - 1][i - 1] % mod);
	}
	return 0;
}