import numpy as np


def primes_np(n):
    is_prime = np.ones(n + 1, dtype=bool)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n ** 0.5) + 1):
        if not is_prime[i]:
            continue
        is_prime[i * 2:n + 1:i] = False
    return np.where(is_prime)[0].tolist()


A, B, N = map(int, input().split())
MOD = 10 ** 9 + 7

ans = 1
for pr in primes_np(B):
    x = pr
    while x <= B:
        ct = B // x - (A - 1) // x
        ans *= pow(pr, pow(ct, N, MOD - 1), MOD)
        ans %= MOD
        x *= pr
print(ans)