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;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
int main() {
  int A, B;
  cin >> A >> B;
  if (A > B) swap(A, B);
  long long ans = 1;
  if (A == 1 && B == 2) ans = 3;
  if (A == 1 && B == 3) ans = 2;
  if (A == 2) ans = 1;
  cout << ans << endl;
}
