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 main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long test = 1;
  while (test--) {
    long a, b, c = 0, k, d = 0, i, n, j, temp, p, m, ex1, ex2, ex3, ex4, x, y;
    string s;
    long long ans = 1, ans2 = 1;
    cin >> n >> c;
    for (i = 0; i < n; i++) {
      if (i % 2 == 0) {
        ans *= c;
      } else
        ans *= (c - 1);
    }
    for (i = 0; i < n; i++) {
      if (i % 2 == 0) {
        ans2 *= c - 1;
      } else
        ans2 *= (c);
    }
    cout << max(ans, ans2);
  }
}
