#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int A,B,N;
ll dfs(int i,ll val) {
    if (i == N) return val;
    ll ans = 1;
    for (int j = A; j <= B; ++j) {
        ans *= dfs(i + 1,__gcd((ll)j,val));
        ans %= MOD;
    }
    return ans;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> A >> B >> N;
    cout << dfs(0,0) << '\n';
    return 0;
}