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;
long long pwr(long long x, int e) {
  if (e == 0) return 1;
  long long tmp = pwr(x, e / 2);
  if (e % 2) tmp *= x;
  return tmp;
}
int main() {
  long long n, k;
  while (cin >> n >> k) {
    if (n > 1)
      cout << k * pwr(n - 1, k - 1) << endl;
    else
      cout << k << endl;
  }
  return 0;
}
