import sys
MOD = 10**9 + 7

def mul(a, b):
    return ((a % MOD) * (b % MOD)) % MOD

def div(a, b):
    return mul(a, pow(b, MOD-2, MOD))

def div2(a, b):
    return mul(a, modinv(b))

def modinv(a):
    b, u, v = MOD, 1, 0
    while b:
        t = a//b
        a, u = a-t*b, u-t*v
        a, b, u, v = b, a, v, u
    u %= MOD
    return u

def frac(limit):
    frac = [1]*limit
    for i in range(2,limit):
            frac[i] = i * frac[i-1]%MOD
    fraci = [None]*limit
    fraci[-1] = pow(frac[-1], MOD -2, MOD)
    for i in range(-2, -limit-1, -1):
            fraci[i] = fraci[i+1] * (limit + i + 1) % MOD
    return frac, fraci

frac, fraci = frac(1341398)
def cmb(a, b):
    if not a >= b >= 0:
            return 0
    return frac[a]*fraci[b]*fraci[a-b]%MOD
def make_divisors(n):
    divisors = []
    for i in range(1, N+1):
        if n % i == 0:
            divisors.append(i)
    return divisors

N, K, M = map(int, input().split())
ss = make_divisors(K)
#print(ss)
a = 0
for y in ss:
    a = (a+pow(N, N-y, MOD)*frac[y-1]*cmb(N-1, y-1))%MOD
if M==1:
    print(a)
else:
    print(div2((pow(N, N, MOD)-a)%MOD, N-1))