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 long long mod = (long long)pow(2, 31) - 1;
long long pow_mod(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  long long mid = pow(a, b / 2);
  if (b % 2 == 0) {
    return (mid * mid) % mod;
  } else {
    return (((a * mid) % mod) * mid) % mod;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  long long n, k;
  cin >> n >> k;
  long long ans = k;
  ans *= pow_mod(n - 1, k - 1);
  ans %= mod;
  cout << ans << "\n";
}
