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 i, N, K, n = 1, k = 1;
  scanf("%d%d", &N, &K);
  if (N == K)
    for (i = 1; i <= K; i++) k = k * i;
  else if (N > K)
    return 0;
  else {
    for (i = 1; i <= (K - N); i++) n = n * i;
    for (i = 1; i <= K; i++) k = k * i;
  }
  printf("%d\n", k);
  return 0;
}
