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 pow(int p, int q) {
  int x = 1;
  while (q > 0) {
    if (q & 1) x *= p;
    p = p * p;
    q >>= 1;
  }
  return x;
}
int main() {
  int k;
  scanf("%d", &k);
  int n;
  scanf("%d", &n);
  int x = 1;
  for (int i = n; i >= 1; i--) {
    x *= i;
  }
  cout << x << endl;
}
