#include <bits/stdc++.h>

using namespace std;

long countArray(int n, int k, int x) {
    if(k==2){
        if(n%2)
            return 1;
        else
            return 0;
    }
    long tmp = pow(k-1,n-2) - pow(k-2,n-3);// Return the number of ways to fill in the array.
    return tmp;
}

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