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>
int p[1001], N, K, count = 0;
void f(int s, int c) {
  int i;
  p[c] = s;
  if (c == N) {
    count++;
    return;
  }
  for (i = 1; i <= K; i++) {
    if (s != i) f(i, c + 1);
  }
}
int main() {
  int p[1001] = {0}, i, j;
  scanf("%d %d", &N, &K);
  f(1, 1);
  printf("%d", count * K);
  return 0;
}
