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 sum =0;
        if(n == 2){
            return 1;
        }
        for(int i = 1 ; i < n-2 ; i++){
            sum += (k-1);
            }
        sum += (k-2);
        return sum;
    }

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