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 factorial(long long n, unordered_map<long long, long long> &m) {
  if (n == 1) return 1;
  if (!m.count(n)) m[n] = n * factorial(n - 1, m);
  return m[n];
}
long long num_permutations(long long n, long long k) {
  unordered_map<long long, long long> m = {{1, 1}};
  if (n == k)
    return factorial(k, m);
  else
    return factorial(k, m) / factorial(k - n, m);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  cout << num_permutations(n, k) << '\n';
  return 0;
}
