without00

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    int n, k;
    cin >> n >> k;
    vector <int> fp(n+1);
    if (n==1) cout << k;
    else{
        fp[0]=k-1;
        fp[1]=fp[0]*k;
        for (int i = 2; i<n; i++) {
             fp[i]=(k-1)*(fp[i-1]+fp[i-2]);
        }
    } cout << fp[n-1];
    return 0;
}