#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long modpow(long long a, long long b){
  long long ans = 1;
  while (b > 0){
    if (b % 2 == 1){
      ans *= a;
      ans %= MOD;
    }
    a *= a;
    a %= MOD;
    b /= 2;
  }
  return ans;
}
void zeta(vector<long long> &A){
  int N = A.size();
  for (int i = 1; i < N; i++){
    for (int j = i * 2; j < N; j += i){
      A[i] += A[j];
      if (A[i] >= MOD){
        A[i] -= MOD;
      }
    }
  }
}
void mobius(vector<long long> &A){
  int N = A.size();
  for (int i = N - 1; i >= 1; i--){
    for (int j = i * 2; j < N; j += i){
      A[i] -= A[j];
      if (A[i] < 0){
        A[i] += MOD;
      }
    }
  }
}
vector<long long> gcd_convolution_pow(vector<long long> A, int K){
  int N = A.size();
  zeta(A);
  for (int i = 0; i < N; i++){
    A[i] = modpow(A[i], K);
  }
  mobius(A);
  return A;
}
int main(){
  int A, B, N;
  cin >> A >> B >> N;
  vector<long long> f(B + 1, 0);
  for (int i = A; i <= B; i++){
    f[i]++;
  }
  f = gcd_convolution_pow(f, N);
  long long ans = 1;
  for (int i = 1; i <= B; i++){
    ans *= modpow(i, f[i]);
    ans %= MOD;
  }
  cout << ans << endl;
}