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;
bool f(int a, int b) {
  if (a == b) {
    return true;
  }
  return false;
}
int main() {
  long long n, k;
  long long ci = 1;
  cin >> n >> k;
  if (k > 2 && n > 2) {
    ci = pow(k - 2, n - 2);
    ci = k * (k - 1) * ci;
  }
  if (n <= 2) {
    while (n--) {
      ci = k * ci;
      k--;
    }
  }
  cout << ci;
  return 0;
}
