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.
        int p = (n<=4) ? 3 : 4;
        long count = (long) (Math.pow(k-1, n-3)*(k-2) + Math.pow(k-1, n-p) - (k-2));
        return count;
    }

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