#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

typedef long long ll;
typedef long double ld;

const ll INF = 1e18;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n, d, k;
    cin >> n >> d >> k;
    // ll dp[n + 1][k + 1];
    vector<vector<ll> > dp(n + 1, vector<ll>(k + 1));
    dp[0][0] = 1;
    rep (i, n) {
        rep (j, k) {
            if (dp[i][j] != 0) {
                FOR (l, 1, d + 1) {
                    if (j + l > k) break;
                    dp[i + 1][j + l] += dp[i][j];
                    dp[i + 1][j + l] %= MOD;
                }
            }
        }
    }
    cout << dp[n][k] << endl;
    
    return 0;
}