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;
bool balance(int x, int y) {
  return ((x >= 0) && (y >= 0)) || ((x < 0) && (y < 0));
}
bool isminus(int x) { return x < 0; }
bool isplus(int x) { return x >= 0; }
int solve(int x, int y, int step) {
  if (x == y) return step;
  if (isplus(x) && isplus(y)) {
    if (x > y) return solve(-x, y, step + 1);
    if (x < y) return solve(x + 1, y, step + 1);
  } else if (isplus(x) && isminus(y)) {
    if (x >= abs(y)) return solve(-x, y, step + 1);
    return solve(x + 1, y, step + 1);
  } else if (isminus(x) && isplus(y)) {
    if (abs(x) > y) return solve(x + 1, y, step + 1);
    return solve(-x, y, step + 1);
  } else if (isminus(x) && isminus(y)) {
    if (x < y) return solve(x + 1, y, step + 1);
    if (x > y) return solve(-x, y, step + 1);
  }
}
int main() {
  int x, y, ans;
  cin >> x >> y;
  cout << solve(x, y, 0) << endl;
}
