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 a, b, cj1 = 1, cj2 = 1;
  scanf("%d %d", &a, &b);
  int j = a;
  if (a > b) printf("0\n");
  if (b == a) printf("1\n");
  if (b > a) {
    for (int i = 1; i <= j; i++) {
      cj1 = cj1 * a;
      cj2 = cj2 * b;
      a--;
      b--;
    }
    cj2 = cj2 / cj1;
    printf("%d\n", cj2);
  }
  return 0;
}
