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(void) {
  int n, k, i, j, pos;
  printf("please give num of balls and num of paints\n");
  scanf("%d %d", &n, &k);
  i = 0;
  j = 0;
  pos = 0;
  for (i = 0; i < n; i++) {
    for (j = 0; j < k; j++) {
      if (i != j) {
        pos++;
      }
    }
  }
  printf("%d", pos);
  return 0;
}
