#include <iostream>
using namespace std;
const long long MOD = 1000000007;
int gcd(int a, int b){
	if (b == 0){
		return a;
	} else {
		return gcd(b, a % b);
	}
}
long long dfs(int N, int A, int B, int cnt, int g){
	if (cnt == N){
		return g;
	} else {
		long long ans = 1;
		for (int i = A; i <= B; i++){
			ans *= dfs(N, A, B, cnt + 1, gcd(g, i));
			ans %= MOD;
		}
		return ans;
	}
}
int main(){
	int A, B, N;
	cin >> A >> B >> N;
	cout << dfs(N, A, B, 0, 0) << endl;
}