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 int maxn = 2e5 + 7;
long long pow_mod(long long a, long long n) {
  long long res = 1, t = a;
  while (n) {
    if (n & 1) res = (res * t);
    t = (t * t);
    n /= 2;
  }
  return res;
}
int main() {
  long long n, k;
  cin >> n >> k;
  if (n == 1) {
    cout << k << endl;
    return 0;
  }
  long long sum;
  sum = n * pow_mod(n - 1, k - 1);
  cout << sum << endl;
  return 0;
}
