ll a, b, n;
int prime[700000], s;
Mint ans = 1;
{
	rd(a, b, n);
	s = Prime(b+1, prime);
	rep(i, s) {
		ll p = prime[i];
		modint sum = 0;
		sum.setmod(MD - 1);
		for (ll i = p; i <= b; i *= p) {
			modint x = b / i - (a - 1) / i;
			sum += x.pw(n);
		}
		ans *= Mint(p).pw(sum.val);
	}
	wt(ans);
}