def powmod(n,pow,mod):
    val = 1
    while pow > 0:
        if pow & 1:
            val = (val * n) % mod
        pow = pow >> 1
        n = (n * n) % mod
    return val

def matdot(a,b,mod):
    matsize = len(a)
    val = [[0 for i in range(matsize)] for j in range(matsize)]
    for i in range(matsize):
        for j in range(matsize):
            for k in range(matsize):
                val[i][j] = (val[i][j] + a[i][k] * b[k][j]) % mod
    return val

def powmodmat(n,pow,mod):
    matsize = len(n)
    val = [[0 for i in range(matsize)] for j in range(matsize)]
    for i in range(matsize):
        val[i][i] = 1
    while pow > 0:
        if pow & 1:
            val = matdot(val, n, mod)
        pow = pow >> 1
        n = matdot(n, n, mod)
    return val

c, n, m = map(int, input().split())
p = 10**9+7
inv = powmod(c,p-2,p)
mat = [[inv,0,0,inv*(c-1)%p],[0,inv,inv,inv*(c-2)%p],[1,0,0,0],[0,1,0,0]]
kari = powmodmat(mat,n,p)
a = kari[0][0]
ans = (1 - powmod((1-a)%p,m,p)) % p
print("{}".format(ans))