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, i, mul, div;
  scanf("%d", &n);
  scanf("%d", &k);
  if (n >= k) {
    for (i = n; i != 0; i--) {
      mul = n * i - 1;
    }
    div = mul / (k * (n - k));
    printf("%d", div);
  }
  if (n <= k) {
    for (i = k; i != 0; i--) {
      mul = k * i - 1;
    }
    div = mul / (n * (k - n));
    printf("%d", div);
  }
  return 0;
}
