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

typedef long long ll;
const int MOD = 1e9 + 7;
struct mint {
	int x;
	mint() : x(0) {}
	mint(int x) : x(x) {}
	mint operator+(int ot) const { return x + ot >= MOD ? x + ot - MOD : x + ot; }
	mint operator-(int ot) const { return x < ot ? x - ot + MOD : x - ot; }
	mint operator*(int ot) const { return 1ll * x * ot % MOD; }
	mint operator+=(int ot) { return *this = *this + ot; }
	mint operator-=(int ot) { return *this = *this - ot; }
	mint operator*=(int ot) { return *this = *this * ot; }
	operator int() { return x; }
};
mint mpow(mint a, ll x) {
	mint r = 1;
	while (x) {
		if (x & 1) r *= a;
		a *= a;
		x /= 2;
	}
	return r;
}

mint binom(int n, int k) {
	mint r = 1;
	for (int i = 1; i <= k; i++) r *= i;
	r = mpow(r, MOD - 2);
	for (int i = n; i > n - k; i--) r *= i;
	return r;
}

mint pw[1010101];
int main() {
	mint n, m, k;
	cin >> n.x >> m.x >> k.x;
	pw[0] = 1;
	for (int i = 1; i < 1010101; i++) pw[i] = pw[i - 1] * k;

	mint ans = 0;
	mint acc = 0;
	for (int l = (m.x + 1) / 2; l <= m.x; l++) {
		if (k.x < m.x - l) continue;

		mint cnt = binom(k, m - l);
		for (int i = 1; i <= m - l; i++) cnt *= i;

		mint tot = 0;

		int z = (2 * l - m) / 2;
		if (z < l - k.x) {
			continue;
		}
		mint s = binom(k - m + l, z) * binom(k - m + l - z, 2 * l - m - 2 * z) * mpow(2, MOD - 1 - z);
		for (int i = 1; i <= 2 * l - m; i++) s *= i;

		for (int x = z; x >= 0; x--) {
			if (x < l - k.x) continue;
			tot += s;
			if (x != 0) {
				s *= x;
				s *= mpow(2 * l - m - 2 * x + 1, MOD - 2);
				s *= mpow(2 * l - m - 2 * x + 2, MOD - 2);
				s *= (k - l + x);
				s *= 2;
			}
		}
		cnt *= tot;

		if (l != m.x) {
			acc += cnt;
		}
		else {
			cnt -= acc;
		}

		mint cur = 0;
		for (int r = 1; r <= (n.x - m.x + l) / l; r++) {
			int sz = r * l + (m.x - l);
			int rp = (l == m.x) ? r : (r + 1) / 2;

			int sx = 0;
			int ex = min(n.x - sz, l - 1);

			int sy = max(0, n.x - sz - l + 1);
			int ey = n.x - sz;

			if (ex < sy) {
				cur += pw[n.x - sz - l] * (ex - sx + 1 + ey - sy + 1) * (pw[l] - 1) * rp;
				cur += pw[n.x - sz - 2 * l] * (pw[l] - 1) * (pw[l] - 1) * (sy - ex - 1) * rp;
			}
			else {
				cur += pw[n.x - sz - l] * (pw[l] - 1) * (sy - sx + ey - ex) * rp;
				cur += pw[n.x - sz] * (ex - sy + 1) * rp;
			}
			//cout << sz << ' ' << "[" << sx << ", " << ex << "] " << "[" << sy << ", " << ey << "]\n";
		}
		//cout << l << ' ' << cnt << ' ';
		//cout << cur << endl;
		ans += cur * cnt;
	}
	cout << ans << '\n';
}