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 INF = 1e9, MOD = 1e9 + 7;
const long long LINF = 1e18;
long long int n, cnt = 0, ans = 1, a, b, c, cmp, data, m, h, x, y;
string s, w;
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> a;
  ans *= a;
  for (long long int(i) = 0; (i) < (int)(a - 1); (i)++) {
    ans *= a - 1;
  }
  cout << ans << endl;
  return 0;
}
