#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const ll mod = 1000000007;
const int INF = 1001001001;

bool is_prime[10000007];

ll modpow(ll a, ll p, ll m){
    ll ret = 1;
    while(p){
        if(p & 1) ret = ret * a % m;
        a = a * a % m;
        p >>= 1;
    }
    return ret;
}

int main(){
    ll a, b, n, ans = 1;
    cin >> a >> b >> n;
    for(int i = 2; i <= b; i++){
        is_prime[i] = true;
    }
    for(int i = 2; i <= b; i++){
        if(!is_prime[i]) continue;
        for(int j = 2; j*i <= b; j++){
            is_prime[i*j] = false;
        }
    }
    for(int i = 2; i <= b; i++){
        if(!is_prime[i]) continue;
        ll tmp = i;
        while(tmp <= b){
            ll pw = modpow(b/tmp - (a-1)/tmp, n, mod-1);
            ans = ans * modpow(i, pw, mod) % mod;
            tmp *= i;
        }
    }
    cout << ans << endl;
}