#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

constexpr long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, d, k; cin >> n >> d >> k;
    vvll dp(2, vll(k + 1, 0));

    dp[0][0] = 1;
    for (ll i = 0; i < n; i++) {
        vll accdp(k + 2, 0);
        for (ll j = 1; j <= k; j++) {
            accdp[j] = (accdp[j - 1] + dp[0][j - 1]) % MOD;
        }
        for (ll j = 0; j <= k; j++) {
            dp[1][j] = (accdp[j] - accdp[max(0LL, j - d)] + MOD) % MOD;
        }
        swap(dp[0], dp[1]);
    }
    cout << dp[0][k] << '\n';
    return 0;
}