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;
const double pi = acos(-1);
const int maxn = 2e6 + 10;
const double eps = 1e-8;
const long long mod = 1e9 + 7;
const unsigned long long base = 131;
const unsigned long long mod1 = 1e9 + 9;
const unsigned long long mod2 = 1610612741;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int ans = 1;
  if (k < n) ans = 0;
  for (int i = 1; i <= n; ++i) ans *= k - i + 1;
  printf("%d\n", ans);
  return 0;
}
