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>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ld = long double;
const ll LL_MAX = LLONG_MAX;
struct In {
  template <typename T>
  operator T() {
    T x;
    cin >> x;
    return x;
  }
};
template <typename T, typename U>
void forin(T* x, U n) {
  for (U i = 0; i < n; i++) cin >> x[i];
}
template <typename T>
int div1(T x) {
  return x % 1000000007;
}
template <typename T>
void out(T x) {
  cout << x << endl;
}
int main() {
  In in;
  int n = in, k = in;
  out(k * pow((double)(k - 1), n));
}
