#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <random>
#include <time.h>
#define _USE_MATH_DEFINES
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
typedef complex<double> xy_t;
typedef vector<ll> vll;
typedef vector< vector<ll> > matrix;
#define REP(i, x, y) for(ll i = (ll)x; i < (ll)y; i++)
#define DREP(i, x, y, d) for(ll i = (ll)x; i < (ll)y; i += (ll)d)
#define PER(i, x, y) for(ll i = (ll)x; i > (ll)y; i--)
#define DPER(i, x, y, d) for(ll i = (ll)x; i > (ll)y; i -= (ll)d)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
int iinf = intmax / 8;
ll inf = llmax / 8;
double eps = 1e-12;

ll modadd(ll x, ll y) {
    return ((x + y) % mod + mod) % mod;
}

ll modminus(ll x, ll y) {
    return (x - y + mod) % mod;
}

ll multiply(ll x, ll y) {
    return (x % mod) * (y % mod) % mod;
}

ll modpower(ll x, ll y) {
    if (y == 0) {
        return 1;
    } else if (y == 1) {
        return x % mod;
    } else if (y % 2 == 0) {
        ll p = modpower(x, y / 2);
        return p * p % mod;
    } else {
        ll p = modpower (x, y / 2);
        return (p * p) % mod * (x % mod) % mod;
    }
}

ll divide(ll x, ll y) {
    return multiply(x, modpower(y, mod - 2));
}

ll frac[1000020];
ll invfrac[1000020];

void fracinvfrac(ll n) {
    frac[0] = 1;
    for (int i = 1; i <= n; i++) {
        frac[i] = multiply(frac[i - 1], i);
    }
    invfrac[n] = divide(1, frac[n]);
    for (int i = n - 1; i >= 0; i--) {
        invfrac[i] = multiply(invfrac[i + 1], i + 1);
    }
}

ll modcombi(ll x, ll y) {
    if (x < y || y < 0) {
        return 0;
    } else if (y == 0) {
        return 1;
    } else {
        return multiply(multiply(frac[x], invfrac[x - y]), invfrac[y]);
    }
}

ll dp[1000010];
ll fracsum[1000010];
// ll invfracsum[1000010];

int main() {
    fracinvfrac(1000010);
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N, H, D;
    cin >> N >> H >> D;
    fracsum[1] = frac[1];
    REP(i, 2, 1000010) {
        fracsum[i] = modadd(fracsum[i - 1], frac[i]);
    }
    dp[0] = frac[N];
    ll sum = dp[0];
    REP(i, 1, H) {
        dp[i] = multiply(sum, fracsum[N]);
        sum = modadd(sum, dp[i]);
        if (i - D >= 0) {
            sum = modadd(sum, -dp[i - D]);
        }
    }
    ll ans = 0;
    PER(i, H - 1, H - D - 1) {
        ans = modadd(ans, dp[i]);
    }
    // invfracsum[1] = invfrac[1];
    // REP(i, 2, 1000010) {
    //     invfracsum[i] = invfracsum[i - 1] + invfrac[i];
    // }
    // dp[0] = 1;
    // ll sum = 1;
    // REP(i, 1, H + 1) {
    //     ll val = multiply(frac[N], invfracsum[N - 1] + 1);
    //     dp[i] = multiply(sum, val);
    //     sum = modadd(sum, dp[i]);
    //     if (i - D - 1 >= 0) {
    //         sum = modadd(sum, -dp[i - D - 1]);
    //     }
    // }
    // REP(i, 0, H) {
    //     cout << dp[i] << " ";
    // }
    // cout << endl;
    // ll ans = 0;
    // PER(i, H - 1, H - D - 1) {
    //     ans = modadd(ans, dp[i]);
    // }
    // ans = multiply(ans, frac[N]);
    cout << ans << endl;
}


Measured memory_bytes: 31488