#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

namespace tk {
template<typename T>
T mod_pow(T x, T n, const T & mod) {
	assert(mod > 0);
	assert(n >= 0);
	x = (x % mod + mod) % mod;
	T res = 1 % mod;
	while (n > 0) {
		if (n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}
} // namespace tk


int main() {
	int A, B, N;
	cin >> A >> B >> N;
	ll ans = 1;
	vector<int> dp(B + 1);
	for (int i = B; i >= 1; --i) {
		dp[i] = tk::mod_pow<ll>(B / i - (A - 1) / i, N, MOD - 1);
		for (int j = i + i; j <= B; j += i) dp[i] = (dp[i] - dp[j] + MOD - 1) % (MOD - 1);
		ans = ans * tk::mod_pow<ll>(i, dp[i], MOD) % MOD;
	}
	cout << ans << endl;
}