//#pragma GCC optimize ("O3")
//#pragma GCC target ("avx")
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

constexpr ll mod=1e9+7;

ll mod_pow(ll a,ll b ,ll MOD){
	a%=MOD;
	if(b==0)return 1;
	if(b==1)return a;
	ll res=mod_pow(a,b/2,MOD)%MOD;
	res*=res; res%=MOD;
	if(b%2)res*=a;
	return res%MOD;
}

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll a,b,n; cin >> a >> b >> n;
	vector<bool> is_not_prime(b+1,false);
	for(int i=2;i<=b;i++){
		if(!is_not_prime[i]){
			for(int j=i+i;j<=b;j+=i){
				is_not_prime[j]=1;
			}
		}
	}
	a--;
	ll res=1;
	for(ll i=2;i<=b;i++){
		if(is_not_prime[i])continue;
		ll p=i;
		while(p<=b){
			ll q=mod_pow(b/p-a/p,n,mod-1);
			res*=mod_pow(i,q,mod);
			res%=mod;
			p*=i;
		}
	}
	cout << res << endl;
}