#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;
typedef vector <ll> vec;
typedef vector <vec> mat;

ll N, K, L;
ll MOD = 1'000'000'007;

mat mul(mat &A, mat &B) {
  mat C(A.size(), vec(B[0].size()));

  for (int i = 0; i < A.size(); ++i) {
    for (int k = 0; k < B.size(); ++k) {
      for (int j = 0; j < B[0].size(); ++j) {
        C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD;
      }
    }
  }

  return C;
}

// 行列の累乗
mat pow(mat A, ll n) {
  mat B(A.size(), vec(A.size()));

  for (int i = 0; i < A.size(); ++i) {
    B[i][i] = 1;
  }

  while (n > 0) {
    if (n & 1) B = mul(B, A);
    A = mul(A, A);
    n >>= 1;
  }

  return B;
}

int main() {
  cin >> N >> K >> L;

  mat G(N);

  for (ll n = 0; n < N; ++n) {
    for (ll i = 0; i < N; ++i) {
      G[n].push_back(0);
    }
  }

  for (ll n = 0; n < N; ++n) {
    for (ll x = 1; x <= L; ++x) {
      ll a = (n + x) % N;
      G[n][a]++;
    }
  }

  mat C = pow(G, K);
  ll ans = 0;

  /*
  for (ll n = 0; n < N; ++n) {
    for (ll i = 0; i < N; ++i) {
      cerr << G[n][i] << " ";
    }
    cerr << endl;
  }
  */

  for (int i = 0; i < N; ++i) {
    cout << C[i][0] % MOD << endl;
  }

  return 0;
}