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;
long long n, k, ans, j, l;
long double sum1 = 1, sum2 = 1;
int main() {
  cin >> n >> k;
  if (n <= k) {
    while (n > 0) {
      sum1 = sum1 * k;
      n--;
      k--;
    }
    cout << sum1 << endl;
  } else {
    j = k - 1;
    sum1 *= k;
    n--;
    while (n > 0) {
      n--;
      sum1 = sum1 * j;
    }
    cout << sum1 << endl;
  }
  return 0;
}
