N, K, M = map(int, input().split())
mod = 10 ** 9 + 7
n = 10 ** 6 + 5
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod


now = 0
for i in range(1, N + 1):
    if K % i == 0:
        now += fact[N - 1] * invfact[N - i] * pow(N, N - i, mod)
        now %= mod
        
if M == 1:
    print(now)
    exit()
    
ans = (pow(N, N, mod) - now) * pow(N - 1, mod - 2, mod)
print(ans % mod)