// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;
#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

const ll mod = 1e9 + 7;
ll N, H, D;

// 0-indexed
// [l, r)
template <typename T>
struct Bit {
    V<T> data;
    T id_ele;

    Bit(ll size, T id_ele) : id_ele(id_ele) {
        ll bsize = 1;
        while(bsize < size) bsize *= 2;
        data = V<T>(bsize + 1, id_ele);
    }

    T sum(ll pos) {
        T ret = id_ele;
        for(; 0 < pos; pos -= pos & -pos) (ret += data[pos]) %= mod;
        return ret;
    }

    // T sum(ll l, ll r) { return (sum(r) - sum(l) + mod) % mod; }

    void add(ll pos, T delta) {
        for(++pos; pos < data.size(); pos += pos & -pos) (data[pos] += delta) %= mod;
    }
};

ll test() {
    auto dp = make_v<ll>(0, H + 1, H + 1);
    dp[0][0] = 1;
    for(ll i = 0; i <= H; i++) for(ll j = 0; j <= H; j++) {
        if(i == j) {
            for(ll k = 1; k <= D && i + k <= H; k++) {
                (dp[i + k][j] += dp[i][j]) %= mod;
                (dp[i][j + k] += dp[i][j]) %= mod;
            }
        } else if(i < j) {
            for(ll k = j; k <= min(j + D, H); k++) {
                (dp[k][j] += dp[i][j]) %= mod;
            }
        } else {
            for(ll k = i; k <= min(i + D, H); k++) {
                (dp[i][k] += dp[i][j]) %= mod;
            }
        }
    }
    // for(ll i = 0; i <= H; i++) for(ll j = 0; j <= H; j++) printf("dp[%ld][%ld] = %ld\n", i, j, dp[i][j]);
    return dp.back().back();
}

int main() {
    cin >> N >> H >> D;
    V<ll> fact(N + 1, 1);
    for(ll i = 1; i <= N; i++) fact[i] = fact[i - 1] * i % mod;
    Bit<ll> bt(H + 10, 0);
    bt.add(0, fact[N]);
    bt.add(1, (mod - fact[N]) % mod);
    ll fsum = accumulate(fact.begin() + 1, fact.end(), 0ll) % mod;
    for(ll i = 0; i <= H - 2; i++) {
        ll l = i + 1;
        ll r = min(H, i + D + 1);
        ll add_v = bt.sum(i + 1) * fsum % mod;
        // DEBUG(make_tuple(i, add_v));
        bt.add(l, add_v);
        bt.add(r, (mod - add_v) % mod);
    }

    ll ans = 0;
    for(ll i = H - D; i < H; i++) (ans += bt.sum(i + 1)) %= mod;
    cout << ans << endl;
    // cout << test() << endl;
    return 0;
}


Measured memory_bytes: 16384