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 pos = 1;
        if(n == 3){
            if(x == 1){
                pos = k - 1;
            }
            else{
                pos = k - 2;
            }
        }
        else{
            for(int i = 0; i < n - 4; i++){
                pos *= (k - 1);
            }
            pos *= ((k - 2) * (k - 2) + k - 1);
        }
        pos = pos % 1000000007;
        return pos;
    }

    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();
    }
}