from math import ceil, sqrt

def Sieve(n):
    lst = [True] * (n + 1)
    S = set()
    for i in range(2, ceil(sqrt(n)) + 1):
        if lst[i]:
            for j in range(2 * i, n + 1, i):
                lst[j] = False
    for i in range(2, n + 1):
        if lst[i]:
            S.add(i)
    return list(S)

A, B, N = map(int, input().split())
mod = 10**9 + 7
dp = [0] * (B + 1)
for i in range(1, B + 1):
    v = B//i - (A - 1)//i
    dp[i] = pow(v, N, mod - 1)

for p in Sieve(B + 1):
    for j in range(2 * p, B + 1, p):
        dp[j//p] -= dp[j]
    
ans = 1
for i in range(1, B + 1):
    ans *= pow(i, dp[i]%(mod - 1), mod)
    ans %= mod
    
print(ans)