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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, k, d;
const LL MOD = 1000000007;
LL dp[2][100001];
LL hh[2][100001];
LL aa[2][100001];

int main() {
	cin >> n >> k >> d;
	
	LL t = (n - 1) / (k - 1);
	LL l = (n - 1) % (k - 1) + 1;
	
	if(d == 1) {
		cout << l << endl;
		return 0;
	}
	
	//cout << "T: " << t << ",  L: " << l << endl;
	
	int fr = 0, to = 1;
	LL dd = 1;
	hh[fr][1] = 1;
	inc(i, t + 1) {
		inc1(j, l) {
			hh[to][j] = (hh[fr][j] + hh[to][j - 1]) % MOD;
			aa[to][j] = (aa[fr][j] * d + hh[to][j - 1]) % MOD;
			dp[to][j] = (j == 1 ? dd : (dp[fr][j] + dp[to][j - 1] + aa[to][j] + (MOD - aa[fr][j])) % MOD);
		}
		(dd *= d) %= MOD;
		swap(fr, to);
		
		//inc1(x, l) { printf("%10lld ", aa[fr][x]); } cout << endl;
	}
	
	cout << dp[fr][l] << endl;
	
	return 0;
}