#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}



void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const ll M = 1e9 + 7;
const int N = 1e6 + 100;
ll fact[N], rfact[N];

ll pw(ll a, ll n = M - 2) {
    ll ret = 1;
    while (n) {
        if (n & 1) ret = ret * a % M;
        a = a * a % M;
        n >>= 1;
    }
    return ret;
}

void init() {
    fact[0] = 1;
    for (int i = 1; i < N; ++i) {
        fact[i] = fact[i - 1] * i % M;
    }
    rfact[N - 1] = pw(fact[N - 1]);
    for (int i = N - 2; i >= 0; --i) {
        rfact[i] = rfact[i + 1] * (i + 1) % M;
    }
}

ll solve(int n, int h, int d) {
    vl dp_sum(h + 1, 0);
    vl pref_dp(h + 1, 0);
    pref_dp[0] = dp_sum[0] = fact[n];
    ll sum_fact = 0;
    for (int i = 1; i <= n; ++i) {
        sum_fact = (sum_fact + fact[i]) % M;
    }
    for (int i = 1; i < h; ++i) {
        /* fill dp[i][1] */;
        int lf = max(0LL, i - d);
        ll f1;
        if (lf) f1 = (M + pref_dp[i - 1] - pref_dp[lf - 1]) % M;
        else f1 = pref_dp[i - 1];

//        for (int j = max(0LL, i - d); j < i; ++j) {
//            f1 = (f1 + dp_sum[j]) % M;
//        }

        dp_sum[i] = f1 * sum_fact % M;
        pref_dp[i] = (pref_dp[i - 1] + dp_sum[i]) % M;
    }

    ll f1 = 0;
    for (int j = max(0LL, h - d); j < h; ++j) {
        f1 = (f1 + dp_sum[j]) % M;
    }
    return f1;
}


ll solve_old(ll n, ll h, ll d) {
    vl dp_sum(h + 1, 0);
    vvl dp(h + 1, vl (n + 1, 0));
    dp_sum[0] = fact[n];
    for (int i = 1; i <= h; ++i) {
        for (int j = max(0LL, i - d); j < i; ++j) {
            dp[i][1] = (dp[i][1] + dp_sum[j]) % M;
        }
        dp_sum[i] = dp[i][1];
        for (int j = 2; j <= n; ++j) {
            dp[i][j] = dp[i][j - 1];
            dp_sum[i] = (dp_sum[i] + dp[i][j] * fact[j]) % M;
        }
    }
    return dp[h][n];
}

void smain() {

    init();

    int n, h, d;
    cin >> n >> h >> d;
    cout << solve(n, h, d) << '\n';
//    cout << solve_old(n, h, d);
}


Measured memory_bytes: 31488