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 fact(int x) {
  int i, sum = 1;
  for (i = 1; i <= x; i++) {
    sum *= i;
  }
  return sum;
}
int main() {
  long int n, k, sum = 1;
  long int i, m, p, temp, o;
  scanf("%ld %ld", &n, &k);
  if (n > k) {
    m = fact(n);
    p = fact(k);
    o = fact(n - k);
    temp = m / (p * o);
    printf("%ld", temp);
  } else {
    for (i = 1; i <= n; i++) {
      sum *= k;
      k--;
    }
    printf("%ld", sum);
  }
  return 0;
}
