There are N balls placed in a row. AtCoDeer the deer is painting each of these in one of the K colors of his paint cans. For aesthetic reasons, any two adjacent balls must be painted in different colors.

Find the number of the possible ways to paint the balls.

Constraints

* 1≦N≦1000
* 2≦K≦1000
* The correct answer is at most 2^{31}-1.

Input

The input is given from Standard Input in the following format:


N K


Output

Print the number of the possible ways to paint the balls.

Examples

Input

2 2


Output

2


Input

1 10


Output

10
#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1.0);
const long long day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long arr[3000000];
void input(long long n) {
  for (long long i = 0; i < n; ++i) cin >> arr[i];
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long up = (n + 1) / 2;
  long long rem = n - up;
  long long ans = 1;
  for (long long i = 0; i < up; ++i) ans *= k;
  for (long long i = 0; i < rem; ++i) ans *= (k - 1);
  cout << ans;
}
int32_t main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
