#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#else
#define dump(...)
template<class T>inline auto d_val(T a, T b) { return a; }
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
#define SORT(x) do{sort(ALL(x));}while(false)
#define RSORT(x) do{sort((x).rbegin(),(x).rend());}while(false)
#define UNIQUE(v) do{v.erase( unique(v.begin(), v.end()), v.end() );}while(false)
#define MAX(x,y) do{x = std::max(x,y);}while(false)
#define MIN(x,y) do{x = std::min(x,y);}while(false)
#define BR do{cout<<"\n";}while(false)

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::sort;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* define hash */
namespace std { template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } }; }

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

//=============================================================================================

ll comb(ll a, ll b) {
	static constexpr ll size = 1e6;
	static VL fac(size);
	static VL finv(size);
	static VL inv(size);
	static ll n = 0;
	if (n > a) {
		return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
	}
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	FOR(i, 2, a + 1) {
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		fac[i] = fac[i - 1] * (ll)i % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
	n = a + 1;
	return comb(a, b) % MOD;
}

ll frac(ll n) {
	static ll now = 1;
	static VL ans(1e6 + 1, 1);
	if (n < now) { return ans[n]; }
	FOR(i, now, n + 1) {
		ans[i] = ans[i - 1] * i;
		ans[i] %= MOD;
	}
}

ll pow(ll a, ll b) {
	ll ans = 1;
	while (b > 0) {
		if (b % 2 == 1) {
			ans *= a;
			ans %= MOD;
		}
		b /= 2;
		a *= a;
		a %= MOD;
	}
	return ans;
}

signed main() {
	ll n, k;
	cin >> n >> k;
	ll rk = n - k;

	cout << 2 + rk - 1 << endl;
	FOR(i, 2, k + 1) {
		ll b = comb(k - 1, i - 1);
		ll r = 0;
		REP(j, rk + 1) {
			if (rk - j < i - 1) { break; }
			ll tmp = 1;
			tmp *= j + 1;
			tmp *= comb(rk - j - 1, i - 2);
			tmp %= MOD;
			// dump(rk - j, i - 2);
			// dump(j, tmp);
			r += tmp;
			r %= MOD;
		}
		// dump(b, r); BR;
		cout << (r * b) % MOD << endl;
	}
}


Measured memory_bytes: 23680