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;
        if(x <= k){
            //leaving first, last ,second last
            for(int i=1; i<n-3; i++)
                ans *= k-1;
            ans *= (k-1)+((k-2)*(k-2));
        }
        else{
            //leaving first and last index i.e total elements covered = n-2
            for(int i=1; i<n-1; i++)
                ans *= k-1;
        }
        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();
    }
}