#include <stdio.h>

const int Mod = 1000000007;

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

int main()
{
	int N, M;
	long long K;
	scanf("%d %lld %d", &N, &K, &M);
	
	int i;
	long long pow[1000001], fact[1000001], fact_inv[1000001], ans = 0;
	for (i = 1, pow[0] = 1; i <= N; i++) pow[i] = pow[i-1] * N % Mod;
	for (i = 1, fact[0] = 1; i <= N; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N - 1, fact_inv[N] = div_mod(1, fact[N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;
	
	if (M == 1) {
		for (i = 1; i <= N; i++) {
			if (K % i != 0) continue;
			ans += fact[N-1] * fact_inv[N-i] % Mod * pow[N-i] % Mod;
		}
	} else {
		if (K < N) ans += fact[N-2] * fact_inv[N-K-1] % Mod * pow[N-K] % Mod;
		for (i = 2; i <= N; i++) {
			if (i > K) break;
			if (K % i != 0) ans += fact[N-2] * fact_inv[N-i] % Mod * i % Mod * pow[N-i] % Mod;
			else ans += fact[N-2] * fact_inv[N-i] % Mod * (i - 1) % Mod * pow[N-i] % Mod;
		}
	}
	
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}