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;
using ll = long long;
const int N = 1000 + 5;
const int K = 1000 + 5;
ll f[N], dp[N][K];
void math() {
  f[1] = 1;
  for (int i = 2; i <= N; i++) {
    f[i] = f[i - 1] * 1LL * i;
  }
  for (int i = 0; i <= 1000; i++) {
    for (int j = 0; j <= 1000; j++) {
      if (j == 0 or j == i)
        dp[i][j] = 1LL;
      else
        dp[i][j] = 1LL * dp[i - 1][j - 1] + dp[i - 1][j];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  math();
  int n, k;
  cin >> n >> k;
  cout << dp[k][n] * f[n];
}
