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;
bool bo[100];
long long dp[1001][1001];
long long f(long long n, long long r) {
  if (r == 1) return n;
  if (n == r) return 1;
  if (dp[n][r] != -1) {
    return dp[n][r];
  }
  dp[n][r] = f(n - 1, r) + f(n - 1, r - 1);
  return dp[n][r];
}
long long ff(long long n) {
  if (n == 0) return 1;
  if (n == 1) return 1;
  return n * ff(n - 1);
}
int main() {
  for (int i = 0; i < 1001; i++) {
    for (int j = 0; j < 1001; j++) {
      dp[i][j] = -1;
    }
  }
  long long n, r;
  cin >> n >> r;
  cout << f(r, n) * ff(n) << endl;
}
