#include<iostream>
#include<vector>

using namespace std;
using ll=long long;

vector<int> Sieve_of_Eratosthenes(int N){
    vector<int> T(N+1,1);
    T[0]=0; T[1]=0;
    
    for (int x=4; x<=N; x+=2) T[x]=0;
    for (int x=9; x<=N; x+=3) T[x]=0;

    int a=5,b,c;
    int Flag=0;
    while (a*a<=N){
        if (T[a]){
            b=a*a;
            c=2*a;
            while (b<=N){
                T[b]=0;
                b+=c;
            }
        }
        a+=2+2*Flag;
        Flag^=1;
    }

    vector<int> P;
    for (int x=0; x<=N; x++){
        if (T[x]) P.push_back(x);
    }
    return P;
}

ll pow_mod(ll a, ll k, ll mod){
    if (k==0) return 1;
    else if (k%2) return (a*pow_mod(a,k-1,mod))%mod;
    else{
        ll b=pow_mod(a,k/2,mod);
        return (b*b)%mod;
    }
}

int main(){
    int A,B,N;
    cin >> A >> B >> N;
    vector<int> P=Sieve_of_Eratosthenes(B);
    
    ll X=1, Mod=1e9+7,q,t,c;
    for (auto p:P){
        q=p; t=0;
        while (1){
            if (q>B) break;
            
            c=B/q-(A-1)/q;
            if (c==0) continue;
            t+=pow_mod(c,N,Mod-1); t%=Mod-1;
            q*=p;
        }
        X*=pow_mod(p,t,Mod); X%=Mod;
    }
    
    cout << X << endl;
}