#include <bits/stdc++.h>

using namespace std;

long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    int i;
    long product=1;
    long sum=0;
    for(i=1;i<k;i++)
    {
   product=product* (k-1);
        sum=0-(i-1);
    }
    long result=product+sum;
    return result;
    
}

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