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;
long long int lucas(int n, int m, long long int jc[1008]) {
  long long int a = jc[n];
  long long int b = (jc[m] * jc[n - m]);
  return a / b;
}
long long int gp(int a, int b) {
  long long int r = 1;
  int i;
  for (i = 1; i <= b; i++) r *= a;
  return r;
}
int main() {
  int n, k, i, j, t;
  long long int r = 0;
  long long int jc[1008] = {0};
  cin >> n >> k;
  jc[0] = 1;
  for (i = 1; i < 1008; i++) jc[i] = (jc[i - 1] * i);
  for (i = 2; i <= n && i <= k; i++) {
    long long int c = lucas(k, i, jc);
    long long int p = i * gp(i - 1, n - 1);
    r = r + c * p;
  }
  cout << r << endl;
  return 0;
}
