#include <atcoder/modint>
#include <iostream>
#include <vector>

using namespace std;
using mint = atcoder::modint1000000007;

void solve() {
    int n, k, l;
    cin >> n >> k >> l;

    vector<mint> dp(n, 0);
    dp[0] = 1;

    while (k--) {
        vector<mint> ndp(n + l + 1, 0);

        for (int i = 0; i < n; ++i) {
            ndp[i + 1] += dp[i];
            ndp[i + l + 1] -= dp[i];
        }

        for (int i = 1; i <= n + l; ++i) {
            ndp[i] += ndp[i - 1];
        }

        for (int i = n; i < n + l; ++i) ndp[i - n] += ndp[i];

        ndp.resize(n);
        swap(dp, ndp);
    }

    for (int i = 0; i < n; ++i) cout << dp[i].val() << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}