#include <iostream>
#include <vector>
#define vll vector<ll>
using namespace std;
typedef long long int ll;

#define P 1000000007
inline ll mpow(ll a, ll b, ll p){
  ll ret = 1, num = a;
  for(;b;){
    if(b%2) ret = (ret*num)%p;
    num = (num*num)%p;
    b/=2;
  }
  return ret;
}
int main(int argc, char const *argv[]) {
  ll a, b, n, ans = 1;
  scanf("%lld %lld %lld", &a, &b, &n);
  ll cnt[b+1];
  for(int g=b;g>=2;g--){
    ll tmp = (b/g) - ((a-1)/g);
    cnt[g] = mpow(tmp, n, P-1);
    for(int k=2*g;k<=b;k+=g) {
      cnt[g] = (cnt[g] - cnt[k]);
      if(cnt[g]<0) cnt[g] += P-1;
    }
    ans = (ans * mpow(g, cnt[g], P))%P;
  }
  printf("%lld\n", ans);
}