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