#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int n, k, l;
vector<mint> mul(const vector<mint>&a, const vector<mint>&b) {
	vector<mint> c(a.size());
	rep(i, a.size()) rep(j, b.size()) {
		c[(i + j) % n] += a[i] * b[j];
	}
	return c;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> k >> l;
	vector<mint> a(n);
	vector<mint> b(n);
	a[0] = 1;
	rep2(i, 1, l + 1) b[i%n] = 1;
	while (k > 0) {
		if (1 == k % 2) {
			a = mul(b, a);
		}
		k /= 2;
		b = mul(b, b);//B*B
	}
	rep(i, n) {
		cout << a[i].val() << endl;
	}
	return 0;
}