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>
int main() {
  int n, k, fac1 = 1, fac2 = 1, fac3 = 1, t;
  scanf("%d%d", &n, &k);
  if (n == k)
    printf("%d", n);
  else {
    while (k >= 1) {
      fac1 = fac1 * k;
      --k;
    }
    while (n >= 1) {
      fac2 = fac2 * n;
      --n;
    }
    t = k - n;
    while (t >= 1) {
      fac3 = fac3 * (t);
      --(t);
    }
    printf("%d", fac1 / (fac2 * fac3));
  }
  return 0;
}
