#!/bin/python3

import sys

def countArray(n, k, x):
    # Return the number of ways to fill in the array.
    tmp = k-1
    if x == 1:
        ans = 0
    else:
        ans = 1
    for i in range(1,n-1):
        ans = tmp - ans
        ans+=1000000007
        ans%=1000000007
        tmp *= (k-1)
        tmp %= 1000000007
    return ans    

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)