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;
const int intinf = INT_MAX;
const long longinf = LONG_MAX;
const double doubleinf = DBL_MAX;
long long int f(int a, int b, int s, int t = -1) {
  if (t == -1) t = s;
  if (a == 1) return t;
  long long int cnt = 0;
  for (int i = 0; i < s; i++) {
    if (i == b) continue;
    cnt += f(a - 1, i, s, s - 1);
  }
  return cnt;
}
int main(void) {
  int N, K;
  cin >> N >> K;
  cout << f(N, -1, K);
  return 0;
}
