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;
struct edge {
  int to, cost;
};
const int INF = 100000000;
long long int N, M, Q, B, C, D;
long long int A[100010];
std::string S[5];
std::set<int> Union;
std::map<int, int> Hash;
int main() {
  long long int ans = 1;
  cin >> N >> M;
  if (N == 1) {
    cout << M << endl;
    return 0;
  }
  for (int i = 0; i < 2; i++) {
    ans *= M;
  }
  for (int i = 0; i < N - 2; i++) {
    ans *= (M - 1);
  }
  cout << ans << endl;
}
