object Solution {

    def countArray(n: Int, k: Int, x: Int): Long =  {
        // Return the number of ways to fill in the array.
        val actualLength = n - 2 
        //println(actualLength)
        val range = k - 1
        //println(range)
        val result = (Math.pow(actualLength, range))
        println(result)
        return (result % Math.pow(10,9) + 7).toLong
    }

    def main(args: Array[String]) {
        val sc = new java.util.Scanner (System.in);
        var n = sc.nextInt();
        var k = sc.nextInt();
        var x = sc.nextInt();
        val answer = countArray(n, k, x);
        println(answer)
    }
}