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;
void solveEachTest(long long int T35TC453N = 1) {
  long long int n, k;
  cin >> n >> k;
  long long int ans = k;
  for (auto i = (0LL); (((1LL) < 0) ? (i) > (k - 1) : (i) < (k - 1));
       (i) += (1LL)) {
    ans *= (k - 1);
  }
  cout << ans;
  cout << "\n";
  return;
}
signed main() {
  long long int T3X0 = 0, T353 = 1;
  solveEachTest(T353 - T3X0);
  return 0;
}
