#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
//#include<boost/multiprecision/cpp_int.hpp>
//namespace mp=boost::multiprecision;
//using Bint=mp::cpp_int;
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
using mint=modint1000000007;
//using mint=modint998244353;
const ll mod=1000000007;
//const ll mod=998244353;
//using mint=modint;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
ll Mypow(ll a,ll n,ll m){
  ll res=1;
  while(n){
    if(n%2)res=res*a%m;
    a=a*a%m;n/=2;
  }
  return res;
}
int main(){
  ll A,B,N;cin>>A>>B>>N;
  vector<ll>DP(B+1);
  FOR(i,1,B+1)DP[i]=Mypow(B/i-(A-1)/i,N,mod-1);
  vector<bool>F(B+1,1);F[0]=F[1]=0;
  FOR(i,1,B+1)if(F[i])FOR(j,2,B/i+1)F[i*j]=0;
  vector<ll>T(B+1);T[0]=T[1]=-1e18;
  FOR(i,2,B+1)if(F[i]){
    FOR(j,1,B/i+1){
      if(j%i)T[i*j]++;
      else T[i*j]=-1e18;
    }
  }
  vector<PA>P;FOR(i,2,B+1)if(T[i]>0)P.emplace_back(PA(i,T[i]));
  mint ans=1;
  RFOR(i,1,B+1){
    ll k=DP[i];
    for(auto[j,c]:P){
      if(i*j>B)break;
      if(c%2)k-=DP[i*j];
      else k+=DP[i*j];
      k%=mod-1;
    }
    if(k<0)k+=mod-1;
    ans*=Mypow(i,k,mod);
  }
  cout<<ans<<endl;
  return 0;
}