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 list[1010] = {0};
int ans = 0;
void dfs(int n) {
  if (n == N)
    ans++;
  else if (n == 0) {
    for (int i = 0; i < K; i++) {
      list[0] = i;
      dfs(1);
      list[0] = 0;
    }
  } else {
    for (int i = 0; i < K; i++) {
      if (i == list[n - 1]) continue;
      list[n] = i;
      dfs(n + 1);
      list[n] = 0;
    }
  }
}
int main() {
  cin >> N >> K;
  dfs(0);
  cout << ans;
  return 0;
}
