## https://yukicoder.me/problems/no/1706

MOD = 10 ** 9 + 7

def prod(matrix1, matrix2):
    new_matrix = [[0] * 4 for _ in range(4)]
    for i in range(4):
        for j in range(4):
            for k in range(4):
                new_matrix[i][j] += (matrix1[i][k] * matrix2[k][j]) % MOD
                new_matrix[i][j] %= MOD
    return new_matrix

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

    # バス1台について「N時点でバス停1にいない」確率を求める
    # 0: バス停1にいる組み合わせ
    # 1: バス停x(x>=2)にいる組み合わせ
    # 2: バス停1に向かっている最中の組み合わせ
    # 3: バス停x(x>=2)に向かっている最中の組み合わせ
    dp = [0] * 4
    dp[0] = 1
    inv_c = pow(C, MOD - 2, MOD)
    inv_c1 = ((C - 1) * inv_c) % MOD
    inv_c2 = ((C - 2) * inv_c) % MOD


    matrix = [[0] * 4 for _ in range(4)]
    matrix[0][0] = inv_c
    matrix[3][0] = inv_c1
    matrix[1][1] = inv_c
    matrix[2][1] = inv_c
    matrix[3][1] = inv_c2
    matrix[0][2] = 1
    matrix[1][3] = 1

    base_matrix = [[0] * 4 for _ in range(4)]
    for i in range(4):
        base_matrix[i][i] = 1    
    while N > 0:
        if N % 2 == 1:
            base_matrix = prod(base_matrix, matrix)
        
        matrix = prod(matrix, matrix)
        N //= 2

    init_vector = [1, 0, 0, 0]
    vector = [0] * 4
    for i in range(4):
        for j in range(4):
            vector[i] += (base_matrix[i][j] * init_vector[j]) % MOD
            vector[i] %= MOD

    ans = 0
    for i in range(1, 4):
        ans += vector[i]
        ans %= MOD

    # Mのバスの分だけかける
    ans = pow(ans, M, MOD)
    answer = (1 - ans) % MOD
    print(answer)


if __name__ == "__main__":
    main()