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, a[1010][1010];
void init() {
  for (int i = 0; i < 1010; i++) {
    a[i][0] = 1;
    a[i][i] = 1;
    for (int j = 1; j < i; j++) {
      a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
    }
  }
}
int main() {
  scanf("%d%d", &n, &k);
  init();
  long long sum;
  if (n == 1) {
    sum = a[k][1];
  } else {
    sum = a[k][1] * (n - 1) * a[k - 1][1];
  }
  printf("%lld\n", sum);
  return 0;
}
