import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

mx = 10000001
isprime = [True]*mx
pp = []
for a in range(2, mx):
    if isprime[a]:
        pp.append(a)
        for b in range(a*a, mx, a):
            isprime[b] = False

a, b, n = LI()
ans = 1
for p in pp:
    cnt = 0
    s = p
    while s <= b:
        cnt += pow(b//s-(a-1)//s, n, md)
        s *= p
    ans = ans*pow(p, cnt, md)%md
print(ans)