#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

VVI prd(VVI& a, VVI& b){
    int n=a.size(), m=b[0].size();
    VVI ret(n,VI(m));
    REP(i,n)REP(j,m){
        ll sum=0;
        REP(k,a[0].size()){
            sum=(sum+a[i][k]*b[k][j]%MOD)%MOD;
        }
        ret[i][j]=sum;
    }
    return ret;
}

VVI matrix_power(VVI x, ll y){
    int n=x.size();
    VVI ret(n,VI(n,0));
    REP(i,n) ret[i][i]=1;
    while(y){
        if(y&1) ret=prd(ret,x);
        x=prd(x,x);
        y>>=1;
    }
    return ret;
}

int main(){
    int n, k, l; cin >> n >> k >> l;
    VVI a(n,VI(n,0));
    REP(i,n){
        for(int j=i-1;j>=i-l;j--){
            a[i][(j+2*n)%n]++;
        }
    }
    a=matrix_power(a,k);
    VVI x(1,VI(n,0)); x[0][0]=1;
    VVI ans=prd(x,a);
    for(int i=n;i>0;i--)
        cout << ans[0][i%n] << endl;
}