#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

vector<bool> sieve_of_eratosthenes(int val) {
  vector<bool> res(val + 1, true);
  res[0] = false;
  if (val >= 1) res[1] = false;
  for (int i = 2; i * i <= val; ++i) {
    if (res[i]) {
      for (int j = i * i; j <= val; j += i) res[j] = false;
    }
  }
  return res;
}

ll mod_pow(ll base, ll exponent, int md = MOD) {
  base %= md;
  ll res = 1;
  while (exponent > 0) {
    if (exponent & 1) (res *= base) %= md;
    (base *= base) %= md;
    exponent >>= 1;
  }
  return res;
}

int main() {
  int a, b, n; cin >> a >> b >> n;
  vector<bool> ps = sieve_of_eratosthenes(b);
  ll ans = 1;
  FOR(i, 2, b + 1) {
    if (!ps[i]) continue;
    ll p = 0;
    for (ll j = i; j <= b; j *= i) (p += mod_pow(b / j - (a - 1) / j, n, MOD - 1)) %= MOD - 1;
    (ans *= mod_pow(i, p, MOD)) %= MOD;
  }
  cout << ans << '\n';
  return 0;
}