#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
#include <cassert>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<int, ll> i_ll;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> vi;
struct edge { int v; ll w; };

ll _MOD = 1000000009;
double EPS = 1e-10;
ll INF = INT_MAX;

const int N = 2000000, MOD = 1e9+7;
ll inv[N + 1], f[N + 1], fi[N + 1];
 
ll C(int x, int y) {
	return f[x] * fi[y] % MOD * fi[x - y] % MOD;
}

ll H(int x, int y) {
	if (!y) return !x;
	return C(x + y - 1, y - 1);
}

int main() {
	inv[1] = 1;
	for (int i = 2; i <= N; i++)
		inv[i] = -MOD / i * inv[MOD % i] % MOD;
	f[0] = fi[0] = 1;
	for (int i = 1; i <= N; i++) {
		f[i] = f[i - 1] * i % MOD;
		fi[i] = fi[i - 1] * inv[i] % MOD;
	}
	int NN, K, D; cin >> NN >> K >> D;
	int n = NN % (K - 1);
	if (!n) n += K - 1;
	int M = (NN - n) / (K - 1);
	if (D == 1) {
		cout << n << endl;
		return 0;
	}
	ll y = 1, ans = 0;
	rep(x, M + 1) {
		ans = (ans + y * n % MOD * H(M - x, n - 1)) % MOD;
		y = y * D % MOD;
	}
	cout << (ans + MOD) % MOD << endl;
}