#!/bin/python3

import sys

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

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)