import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long countArray(int n, int k, int x) {
        // Return the number of ways to fill in the array.
        
        long ans = 1;
        int i;
        
        for(i=1;i<n-2;i++)
        {
            
                ans = ans*(k-1)*(k-1);
                ans = ans - (k-2);
                ans = ans%(1000000000+7);       
            
        }
        
        return ans;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int x = in.nextInt();
        long answer = countArray(n, k, x);
        System.out.println(answer);
        in.close();
    }
}