#!/bin/python3

import sys

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

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)