#include <bits/stdc++.h>
using namespace std;
/**

  f(X, D) = (N - D + 1) * f(X, D - 1) -> D >= 2
  f(X, 1) = (N - 1) * f(X - 1, 1) + (N - 2) * f(X - 1, 2) + ... + 1 * f(X - 1, N - 1) + N * f(X - 1, N)
  f(X, 2) = (N - 1)

  s0 = // 1/(N - 1)! + 1/(N - 2)! + 1/(N - 3)! + 1/(N - 4)! + ... 1/(N - N)!
  
  s1 = // (N - 1)/1 - (N - 1) / (N - 2)

  f(X, 
  f(X, N) = (N - 1)! * (N - 1) * f(X - 1, 1) +
  	    (N - 1)! * (N - 2) * f(X - 1, 2) +
	    ...
	    (N - 1)! * 1 * f(X - 1, N - 1) +
	    (N - 1)! * N * f(X - 1, N)

  f(0, 1) - f(0, 2) - ... - f(0, N)

  f(1, 1)
  **/	
namespace modular_space {
	long long mod;
	struct umod {
		long long val;
		umod(): val(0ll){}
		umod(long long x){ x %= mod; if(x < 0) x += mod; val = x; }
		umod& operator += (umod oth){ val += oth.val; if(val >= mod) val -= mod; return *this; }
		umod& operator -= (umod oth){ val -= oth.val; if(val < 0) val += mod; return *this; }
		umod& operator *= (umod oth){ val = val * oth.val % mod; return *this; }
		umod& operator /= (umod oth){ return *this *= oth.inverse(); }
		umod& operator ^= (long long oth){ return *this = pwr(*this, oth); }
		umod operator + (umod oth) const { return umod(*this) += oth; }
	       	umod operator - (umod oth) const { return umod(*this) -= oth; }
		umod operator * (umod oth) const { return umod(*this) *= oth; }
		umod operator / (umod oth) const { return umod(*this) /= oth; }
		umod operator ^ (long long oth) const { return umod(*this) ^= oth; }
		bool operator < (umod oth) const { return val < oth.val; }
		bool operator > (umod oth) const { return val > oth.val; }
		bool operator <= (umod oth) const { return val <= oth.val; }
		bool operator >= (umod oth) const { return val >= oth.val; }
		bool operator == (umod oth) const { return val == oth.val; }
		bool operator != (umod oth) const { return val != oth.val; }
		umod pwr(umod a, long long b) const {
			umod r = 1;
			for(; b; a *= a, b >>= 1)
				if(b&1)
					r *= a;
			return r;
		}
		umod inverse() const {
			long long a = val, b = mod, u = 1, v = 0;
			while(b){
				long long t = a/b;
				a -= t * b; swap(a, b);
				u -= t * v; swap(u, v);
			}
			if(u < 0)
				u += mod;
			return u;
		}
		friend istream& operator >> (istream &is, umod &oth);
		friend ostream& operator << (ostream &os, const umod& oth);
	};
	ostream& operator << (ostream &os, const umod &oth){
		os << oth.val;
		return os;
	}
	istream& operator >> (istream &is, umod &oth){
		long long x; is >> x;
		oth = umod(x);
		return is;
	}
	struct binprime_kit {
		int sz;
		vector<umod> fat, ifat;
		void init(int s){
			sz = s;
			fat.resize(sz + 1);
			ifat.resize(sz + 1);
			fat[0] = 1;
			for(int i = 1; i <= sz; i++) fat[i] = fat[i - 1] * i;
			ifat[sz] = fat[sz] ^ (mod - 2);
			for(int i = sz - 1; i >= 0; i--) ifat[i] = ifat[i + 1] * (i + 1);
		}
		umod coef(int n, int r){
			if(n < r) return 0;
			return fat[n] / (ifat[r] * ifat[n - r]);
		}
	};
};
using umod = modular_space::umod;
using binkit = modular_space::binprime_kit;
/**
f(0, 1) = 0
f(0, 2) = 1

f(1, 1) = 2
f(1, 2) = 2

f(2, 1) = 2 + 4
f(2, 2) = f(2, 1)
  **/
int main(){
	modular_space::mod = 1'000'000'007;
	int n, h, d; cin >> n >> h >> d;
	vector<umod> f(h + 1), g(h + 1);
	binkit kit; kit.init(h + n + 1);
	f[0] = kit.fat[n];
	umod fac = 0, sum = f[0];
	for(int i = 1; i <= n; i++) fac += kit.fat[i];
	for(int i = 1; i <= h; i++){
		if(i - d - 1 >= 0) sum -= f[i - d - 1];
		umod fact = i == h ? 1 : fac;
		f[i] = fact * sum;
		sum += f[i];
	}
	cout << f[h] << endl;
	return 0;
}


Measured memory_bytes: 47104