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 main() {
  int N, K;
  int *ball, con = 0, flag = 0, MAX;
  int i, j;
  scanf("%d %d", &N, &K);
  ball = (int *)calloc(N, sizeof(int));
  MAX = K;
  while (1) {
    for (j = 0; j < N - 1; j++) {
      if (ball[j] != ball[j + 1])
        continue;
      else
        break;
    }
    if (j == N - 1) con++;
    for (i = 0; i < N; i++) {
      ball[i]++;
      if (ball[i] < MAX) break;
      ball[i] = 0;
    }
    if (i == N) {
      break;
    }
  }
  printf("%d", con);
  return 0;
}
