#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>

using namespace std;

long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    //int array[n];
    //for (int i = 0; i < n; i++) array[i] = 0;
    //array[0] = 1;
    //array[n-1] = x;

    long factorial = 1;
    int poss;
    //for (int i = 2; i < k)
    for (int i = 1; i < (n-1); i++) {
        if (i == 1 || i == (n-2)) poss = k - 1;
        else poss = k;
    
        factorial *= poss;
    }
    
    //cout << factorial << " ";
    
    int sub = 0;
    for (int i = 1; i <= n-2; i++) {
        sub += (i-1);
    }
    //cout << sub << " " << endl;
    
    return (factorial - sub);
}

int main() {
    int n;
    int k;
    int x;
    cin >> n >> k >> x;
    long answer = countArray(n, k, x);
    cout << answer << endl;
    return 0;
}