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;
int n, k;
int memo[1002][1002];
long long doo(int last, int i) {
  if (i == n) return 1;
  long long ans = 0;
  if (memo[i][last] != -1) return 0;
  for (int j = 1; j <= k; j++) {
    if (last != j) ans += doo(j, i + 1);
  }
  return memo[i][last] = ans;
}
int main() {
  cin >> n >> k;
  memset(memo, -1, sizeof(memo));
  cout << doo(0, 0) << endl;
}
