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 n, k;
int init() {
  scanf("%d %d", &n, &k);
  int cnt = 0;
  if (n == 1) {
    printf("%d\n", k);
    return 0;
  } else if (k <= 2) {
    printf("%d\n", k);
    return 0;
  } else
    cnt = n * k;
  printf("%d\n", cnt / 2);
}
int main() {
  init();
  return 0;
}
