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 numways = 0;
void dfs(vector<int>& balls, int n, int k) {
  if (balls.size() == n) {
    numways++;
  } else {
    for (int i = 0; i < k; i++) {
      if (balls.size() == 0 || i != balls.back()) {
        balls.push_back(i);
        dfs(balls, n, k);
        balls.pop_back();
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> balls;
  dfs(balls, n, k);
  cout << numways << endl;
  return 0;
}
