#!/bin/python3

import sys

MOD = 7 + 10 ** 9

def solve(n, k):
    return abs(((1 - k) ** (n - 1) - 1) // k)

def countArray(n, k, x):
    if x != 1:
        res = solve(n, k)
    else:
        res = (k - 1) * solve(n - 1, k)
    return res % MOD

if __name__ == "__main__":
    n, k, x = input().strip().split(' ')
    n, k, x = [int(n), int(k), int(x)]
    answer = countArray(n, k, x)
    print(answer)