#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

ll modpow(ll v, ll N, int mod){
    ll val = 1;
    ll now = v;
    rep(i, 30){
        if ((N >> i) & 1){
            val *= now;
            val %= mod;
        }
        now = now * now;
        now %= mod;
    }
    return val;
}

int main()
{
    int A, B, N;
    cin >> A >> B >> N;
    int mod = 1000000007;
    vector<ll> dp(B + 1);
    for (int i = B; i >= 1; i--){
        for (int j = 2 * i; j <= B; j += i){
            dp[i] -= dp[j];
            dp[i] = (mod - 1 + dp[i]) % (mod - 1); 
        }
        ll v = B/i - (A - 1)/i;
        dp[i] += modpow(v, N, mod - 1);
        dp[i] = (mod - 1 + dp[i]) % (mod - 1); 
    }

    mint ans = 1;
    for (int i = 1; i <= B; i++){
        ans *= mint(i).pow(dp[i]);
    }
    cout << ans.val() << endl;
}