from math import gcd
from functools import reduce

a, b, n = map(int, input().split())
mod = 10**9 + 7

def bfs(L, idx):
    if idx == n:
        return reduce(gcd, L)
    ans = 1
    for i in range(a, b + 1):
        L[idx] = i
        ans *= bfs(L, idx + 1)
        ans %= mod
    return ans

print(bfs([0 for _ in range(n)], 0))