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 dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int N, K;
int dfs(int idx, int pre) {
  if (N == idx) return 1;
  int ret = 0;
  for (int i = 0; i < (int)(K); i++)
    if (pre != i) {
      ret += dfs(idx + 1, i);
    }
  return ret;
}
int main() {
  cin >> N >> K;
  cout << dfs(0, -1) << endl;
  return 0;
}
