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>
using namespace std;
unsigned long long int fac(int n) {
  unsigned long long int fac = 1;
  if (n == 0)
    return 1;
  else {
    for (int i = n; i > 0; i--) fac = fac * i;
    return fac;
  }
}
int main() {
  unsigned long long int res = 1, i, n, k, j;
  cin >> n >> k;
  if (k >= n) {
    res = fac(k) / fac(k - n);
    cout << res;
  }
  return 0;
}
