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, x, ans = 0;
int a[1001], b[1001] = {100001};
void dfs(int s) {
  if (s > n) {
    ans++;
    return;
  }
  for (int i = 0; i < x; i++) {
    if (a[s] == 0 && b[s - 1] != i) {
      a[s] = 1;
      b[s] = i;
      dfs(s + 1);
      a[s] = 0;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> x;
  dfs(1);
  cout << ans << endl;
  return 0;
}
