MOD = 10**9 + 7

def mod_pow(a, b, mod):
    return pow(a, b, mod)

def mod_inv(a, mod):
    return pow(a, mod-2, mod)

C, N, M = map(int, input().split())

# Compute (1/C)^N mod MOD
# This is equivalent to inverse(C^N) mod MOD
inv_c = mod_inv(C, MOD)
prob_not = mod_pow(inv_c, N, MOD)

# Compute (1 - prob_not)^M mod MOD
prob_not_all = pow((1 - prob_not) % MOD, M, MOD)

# The desired probability is 1 - (1 - 1/C^N)^M mod MOD
result = (1 - prob_not_all) % MOD

print(result)