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

// macros
#define int long long 
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define PB push_back
#define MP make_pair
#define bitcount __builtin_popcount
#define watch(x) cerr<< (#x) << " is " << (x) <<"\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first<<32 | (p).second)

// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vi > vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef long double ld;

// template functions
template < typename A, typename B >
ostream& operator << ( ostream& os, const pair< A, B > & p ) {
    return os << "(" << p.first << ", " << p.second << ")";
}
template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "[";
    typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}
template < typename T >
ostream &operator << ( ostream & os, const set< T > &v ) {
    os << "{";
    typename set< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "}";
}
template < typename A, typename B >
ostream &operator << ( ostream & os, const map< A, B > &v ) {
    os << "[";
    typename map< A, B >::const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << it -> first << " -> " << it -> second ;
    }
    return os << "]";
}
template <typename T>
inline void printV(vector<T>& a, int n) { for(int i=0; i<n; i++) { cerr<<a[i]<<" "; } cerr<<"\n"; }
template <typename T>
inline void printVV(vector<vector<T>>& a) { for(int i=0; i<sz(a); i++) { cerr<<a[i]<<"\n"; } cerr<<"\n"; }
template <typename T>
inline void clearVV(vector<vector<T>>& a) { for(auto &x : a) { x.clear(); } a.clear(); }
template <typename T>
inline void assignVV(vector<vector<T>> &a, T val) { for(int i=0; i<sz(a); i++) { a[i].assign(sz(a[i]), val); } }
template<typename T>
T gcd(T a, T b) { if(a==0 or b==0) return a+b; return gcd(b, a%b) ; }

// random number generation
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

// constants
const long double eps = LDBL_EPSILON;
const int inf = 5e8;
const int modn = 1e9+7;
const int MAX = 1e5;

inline int add(int a, int b) { int ret=((ll)a+b)%modn; if(ret<0) ret+=modn; return ret; }
inline int mul(int a, int b) { int ret=((ll)a*b)%modn; if(ret<0) ret+=modn; return ret; }
inline int add(int a, int b, int c) { return add(a, add(b, c)); }
inline int mul(int a, int b, int c) { return mul(a, mul(b, c)); }
inline int addm(int a, int b, int MOD) { int ret=((ll)a+b)%MOD; if(ret<0) ret+=MOD; return ret; }
inline int mulm(int a, int b, int MOD) { int ret=((ll)a*b)%MOD; if(ret<0) ret+=MOD; return ret; }
inline int addm(int a, int b, int c, int MOD) { return addm(a, addm(b, c, MOD), MOD); }
inline int mulm(int a, int b, int c, int MOD) { return mulm(a, mulm(b, c, MOD), MOD); }

int po(int a, int b)
{
	int res=1;
	while(b>0) {
		if(b&1) res=mul(res, a);
		a=mul(a, a);
		b>>=1;
	}
	return res;
}


vector<int> fact(MAX);
int dp[2001][2001];

int C(int n, int r)
{
	if(n<0) return 0;
	if(r<0 or r>n) return 0;
	int num = fact[n];
	int den = mul(fact[n-r], fact[r]);
	return mul(num, po(den, modn-2));
}

void precal()
{
	fact[0] = 1;
	for(int i=1; i<MAX; i++) {
		fact[i] = mul(i, fact[i-1]);
	}
}

//~ int solve(int n, int i)
//~ {
	//~ if(n<0) return 0;
	//~ if(i==0) return 1;
	//~ if(i==1) return (n+1);
	
	//~ int &memo = dp[n][i];
	//~ if(memo!=-1) return memo;
	
	//~ int ans = 0;
	//~ for(int j=0; j<=n; j++) {
		//~ ans = add(ans, solve(n-j, i-1));
	//~ }
	//~ return memo = ans;
//~ }

int solve(int n, int i)
{
	if(n<0) return 0;
	return C(n+i, i);
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // Your code here
    precal();
    //~ memset(dp, -1, sizeof(dp));
	int n, k;
	cin>>n>>k;
	for(int i=1; i<=k; i++) {
		int rem = n-k-(i-1);
		int ans = solve(rem, i);
		ans = mul(ans, solve(k-i, i-1));
		cout<<ans<<"\n";
	}
	cout<<'\n';
	//~ cout<<solve(5, 2)<<"\n";
	//~ watch(solve(5, 3));
    return 0;
}



Measured memory_bytes: 1024