#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
 
int main() {
    ll n, d, k;
    cin >> n >> d >> k;
    
    vvl dp(n+1, vl(k+1));  // dp[i][j] : i回の移動後、j段目にいる場合の数
    vvl rui(n+1, vl(k+2)); // rui[i][j+1] : sum_{0 <= x <= j | dp[i][x]}
    dp[0][0] = 1;
    rep(i, n) {
        exrep(j, 0, k) {
            rui[i][j+1] = (rui[i][j] + dp[i][j])%mod;
        }
        exrep(j, 1, k) {
            dp[i+1][j] = (rui[i][j] + mod - rui[i][j - min(j, d)])%mod;
        }
    }
    
    out(dp[n][k]);
    re0;
}