#include<iostream> #include<string> #include<vector> #include<algorithm> #include<bitset> #include<set> #include<map> #include<stack> #include<queue> #include<deque> #include<list> #include<iomanip> #include<cmath> #include<cstring> #include<functional> #include<cstdio> #include<cstdlib> #include<numeric> //#include<atcoder/all> using namespace std; //using namespace atcoder; #define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(i, n) repr(i, 0, n) #define INF 2e9 #define MOD 1000000007 //#define MOD 998244353 #define LINF (long long)4e18 #define jck 3.141592 #define PI acos(-1.0) const double EPS = 1e-10; using ll = long long; using Pi = pair<int,int>; using Pl = pair<ll,ll>; //using mint = modint998244353; int dh[] = {-1,0,1,0}; int dw[] = {0,1,0,-1}; ll dp[2][100]; ll sum[2][101]; int main(){ int n,k,l; cin >> n >> k >> l; dp[0][0] = 1; repr(i,1,101) sum[0][i] = 1; rep(i,k)rep(j,n){ dp[(i+1)%2][j] += (sum[i%2][j]-sum[i%2][max(0,j-l)]+MOD)%MOD; dp[(i+1)%2][j] %= MOD; if(j-l < 0){ dp[(i+1)%2][j] += (sum[i%2][n]-sum[i%2][n-l+j]+MOD)%MOD; dp[(i+1)%2][j] %= MOD; } sum[(i+1)%2][j+1] = (sum[(i+1)%2][j]+dp[(i+1)%2][j])%MOD; if(i != k-1) dp[i%2][j] = 0; } rep(i,n){ cout << dp[k%2][i] << endl; } }