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 long long INF = (1LL << 60) - 1;
const long long maxN = 1000001;
string extractStringAtKey(string str, long long key) {
  char *s = strtok((char *)str.c_str(), " ");
  while (key > 1) {
    s = strtok(NULL, " ");
    key--;
  }
  return (string)s;
}
bool prime[maxN + 1];
void seive() {
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i * i <= maxN; ++i) {
    if (prime[i]) {
      for (long long j = i * i; j <= maxN; j += i) {
        prime[j] = false;
      }
    }
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  if (n == 1) {
    cout << k;
    return 0;
  }
  cout << n * (k - 1);
}
