#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k, ll mod){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=mod;
        }
        ap=ap*ap;
        ap%=mod;
        k>>=1;
    }
    return ans;
}
ll inv(ll a, ll mod){
    return powmod(a, mod-2, mod);
}
ll c[10000010];
ll memo[10000010];
const int MAX=10000010;
bitset<MAX> isprime;
void sieve(){
	for(int i=3; i<MAX; i++, i++) isprime[i]=1;
	isprime[2]=1;
	for(int i=3; i<MAX; i++){
		if(isprime[i]){
			for(int j=(i<<1); j<MAX; j+=i) isprime[j]=0;
		}
	}
}
int main()
{
	int a, b, n; cin>>a>>b>>n;
	sieve();
	fill(memo, memo+b+1, -1);
	for(int d=b; d>=1; d--){
		if(memo[b/d-(a-1)/d]==-1) memo[b/d-(a-1)/d]=powmod(b/d-(a-1)/d, n, MOD-1);
		c[d]=memo[b/d-(a-1)/d];
	}
	for(int i=2; i<=b; i++){
		if(!isprime[i]) continue;
		for(int j=i; j<=b; j+=i){
			c[j/i]+=MOD-1-c[j];
			if(c[j/i]>=MOD-1) c[j/i]-=(MOD-1);
		}
	}
	ll ans=1;
	for(int i=1; i<=b; i++){
		(ans*=powmod(i, c[i], MOD))%=MOD;
	}
	cout<<ans<<endl;
	return 0;
}