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;
vector<double> up, down;
int i, j, n, k;
double ans = 1;
int main() {
  scanf("%d%d", &n, &k);
  for (i = 1; i <= n; i++) {
    if (i == 1) {
      for (j = k; j > 0; j--) {
        up.push_back(double(j));
        if (j <= k - 1) down.push_back(double(j));
      }
    } else {
      for (j = k - 1; j > 0; j--) {
        up.push_back(double(j));
        if (j <= k - 2) down.push_back(double(j));
      }
    }
  }
  for (i = 0, j = 0; i < up.size();) {
    if (ans * up[i] > INT_MAX) {
      ans /= down[j];
      j++;
    } else {
      ans *= up[i];
      i++;
    }
  }
  while (j < down.size()) {
    ans /= down[j];
    j++;
  }
  printf("%d\n", (int)ans);
  return 0;
}
