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

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

ll N,K,D;
const ll MAX = 1700000;
ll fact [MAX];
const ll MOD = 1e9 + 7;

ll mod_pow(ll x,ll y = MOD - 2)
{
	ll res = 1;
	while(y){
		if(y & 1) (res *= x) %= MOD;
		(x *= x) %= MOD;
		y >>= 1;
	}
	return res;
}

int main()
{
	scanf("%lld%lld%lld",&N,&K,&D);
	ll a = N % (K - 1);
	if(a == 0) a += K - 1;
	ll t = (N - a) / (K - 1);
	if(a == 1){
		printf("%lld\n",mod_pow(D,t));
		return 0;
	}
	if(D == 1){
		printf("%lld\n",a);
		return 0;
	}

	fact [0] = 1;
	for(ll i = 1;i < MAX;i++){
		fact [i] = fact [i - 1] * i % MOD;
	}

	ll ans = 0;
	for(ll i = 0;i <= t;i++){
		ll r = fact [(a - 2) + (t - i)];
		(r *= mod_pow(fact [t - i])) %= MOD;
		(r *= mod_pow(fact [a - 2])) %= MOD;
		(r *= mod_pow(D,i)) %= MOD;
		(ans += r) %= MOD;
	}
	(ans *= a) %= MOD;

	printf("%lld\n",ans);

	return 0;
}