#include <bits/stdc++.h>

using namespace std;

long fact(long a)
{
    int factor=1;
    for(int i=1;i<=a;i++)
    {
        factor*=i;
    }
    return factor;
}

long comb(long a)
{
    return (fact(a)/fact(a-1));
}

long countArray(long n, long k, long x) {
    // Return the number of ways to fill in the array.
    long mult=1;
    if(n%2==0)
    {
        for(long i=1;i<=n-4;i++)
        {
            mult*=comb(k-1);
        }
        mult*=(((((k-1)*(k-1))-(k-1))*(k-2))+(k*(k-1)));
        return mult;
    }
    else
    {
        for(long i=1;i<n-5;i++)
        {
            mult*=comb(k-1);
        }
        mult*=((((k*k)-k)*(k-2))+(k*(k-1)));
        return mult;
     }
}

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