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 read() {
  char ch;
  int input = 0, num = 1;
  do {
    ch = getchar();
    if (ch == '-') num = -1;
  } while (ch < '0' or ch > '9');
  while (ch >= '0' and ch <= '9') {
    input = input * 10 + ch - '0';
    ch = getchar();
  }
  return input * num;
}
int main() {
  int n = read(), k = read();
  int ans = k;
  for (int i = 2; i <= n; i++) ans *= k - 1;
  cout << ans;
  return 0;
}
