#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

template<class T>
vector<vector<T>> prod(vector<vector<T>>& a, vector<vector<T>>& b, long long mod)
{
    vector res(a.size(), vector<T>(b[0].size(), 0));
    rep(i, res.size()) rep(j, res[0].size()) rep(k, a[0].size())
    {
        res[i][j] += a[i][k] * b[k][j];
        res[i][j] %= mod;
    }
    return res;
}

template<class T>
vector<vector<T>> mat_pow(vector<vector<T>> a, long long n, long long mod)
{
    vector res(a.size(), vector<T>(a.size()));
    rep(i, a.size()) res[i][i] = 1;
    while(n)
    {
        if(n & 1) res = prod(a, res, mod);
        a = prod(a, a, mod);
        n >>= 1;
    }
    return res;
}

const i64 mod = 1000000007;

int main()
{
    int n, k, l;
    cin >> n >> k >> l;
    vector dp(n, vector<i64>(n, 0));
    rep(i, n) rep(j, 1, l + 1) dp[i][(i + j) % n] = 1;
    // cout << dp << endl;
    auto t = mat_pow(dp, k, mod);
    rep(i, n) cout << t[0][i] << endl;
}