#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;

const int mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x=0):x((x%mod+mod)%mod){}
	mint operator-() const { return mint(-x);}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod-a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
	mint operator+(const mint a) const { return mint(*this) += a;}
	mint operator-(const mint a) const { return mint(*this) -= a;}
	mint operator*(const mint a) const { return mint(*this) *= a;}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t>>1);
		a *= a;
		if (t&1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod-2);}
	mint& operator/=(const mint a) { return *this *= a.inv();}
	mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

vector<mint> mul(vector<vector<mint>> a, vector<mint> v){
	int n=v.size();
	vector<mint> ans(n);
	rep(i, n) rep(k, n){
		ans[i]+=a[i][k]*v[k];
	}
	return ans;
}

vector<vector<mint>> mulmat(vector<vector<mint>> a, vector<vector<mint>> b){
	int n=a[0].size();
	vector<vector<mint>> ans(n, vector<mint>(n));
	rep(i, n) rep(j, n) rep(k, n){
		ans[i][j]+=a[i][k]*b[k][j];
	}
	return ans;
}

int main(){
	int n, k, l;
	cin>>n>>k>>l;

	vector<mint> dp(n);
	dp[0]=1;
	vector<vector<mint>> mat(n, vector<mint>(n)), dmat;
	rep(i, n) for(int j=1; j<=l; j++){
		mat[i][(i-j+n)%n]=1;
	}

	for(int x=k; x>0; x>>=1){
		if(x&1) dp=mul(mat, dp);
		mat=mulmat(mat, mat);
	}

	rep(i, n) cout<<dp[i]<<endl;
	return 0;
}