#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10 ** 9 + 7
N, K, D = map(int, read().split())


def cumprod(A, MOD=MOD):
    L = len(A)
    Lsq = int(L**.5 + 1)
    A = np.resize(A, Lsq**2).reshape(Lsq, Lsq)
    for n in range(1, Lsq):
        A[:, n] *= A[:, n - 1]
        A[:, n] %= MOD
    for n in range(1, Lsq):
        A[n] *= A[n - 1, -1]
        A[n] %= MOD
    return A.ravel()[:L]


def make_fact(U, MOD=MOD):
    x = np.arange(U, dtype=np.int64)
    x[0] = 1
    fact = cumprod(x, MOD)
    x = np.arange(U, 0, -1, dtype=np.int64)
    x[0] = pow(int(fact[-1]), MOD - 2, MOD)
    fact_inv = cumprod(x, MOD)[::-1]
    fact.flags.writeable = False
    fact_inv.flags.writeable = False
    return fact, fact_inv


def make_power(a, L, MOD=MOD):
    B = L.bit_length()
    x = np.empty((1 << B), np.int64)
    x[0] = 1
    for n in range(B):
        x[1 << n:1 << (n + 1)] = x[:1 << n] * a % MOD
        a *= a
        a %= MOD
    x = x[:L]
    x.flags.writeable = False
    return x


L = N % (K - 1)
if not L:
    L = K - 1
S = (N - L) // (K - 1)

fact, fact_inv = make_fact(2 * 10 ** 6 + 10)
power = make_power(D, S + 1)
coef = fact[L - 2: L + S - 1][::-1] * fact_inv[0: S + 1][::-1] % MOD * fact_inv[L - 2] % MOD
x = (coef * power % MOD).sum() % MOD
answer = x * L % MOD
if D == 1:
    answer = L
print(answer)