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.
        double result = Math.pow((k-1),(n-2));
        double delta = Math.pow((k-1),(n-3));
        if (x != 1) {
            if (n < 4) delta = k-2;
            else delta = Math.pow((k-1),(n-4))*(k-2);
        }
        
        long re = (long) (result - delta);
        return re % (1000000000 + 7);
    }

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