#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

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

#define MOD 1000000007

vector<vector<ll>> matrixmul(ll m,vector<vector<ll>> a,vector<vector<ll>> b){
  vector<vector<ll>> c(m,vector<ll>(m,0));
  rep(i,m){
    rep(j,m){
      rep(k,m) c[i][j]=(c[i][j]+a[i][k]*b[k][j]%MOD)%MOD;
    }
  }
  return c;
}

vector<vector<ll>> matrixpow(ll m,vector<vector<ll>> vec,ll n){
  vector<vector<ll>> ans(m,vector<ll>(m,0));
  rep(i,m) ans[i][i]=1;
  while(n){
    if(n&1) ans=matrixmul(m,ans,vec);
    vec=matrixmul(m,vec,vec);
    n>>=1;
  }
  return ans;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,k,l;
  cin>>n>>k>>l;
  
  vector<vector<ll>> A(n,vector<ll> (n));
  rep(i,n){
    for(int j=i-1;j>=i-l;j--) A[i][(j+n)%n]=1LL;
  }
  
  vector<vector<ll>> B=matrixpow(n,A,k);
  rep(i,n) cout<<B[i][0]<<endl;
    
  return 0;
}