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 solve(long long n) {
  long long nums[4] = {0, 0, 0, 0};
  long long primes[] = {2, 3, 5, 7};
  for (int i = 0; i < 4; ++i) {
    while (n % primes[i] == 0) {
      n /= primes[i];
      ++nums[i];
    }
  }
  long long ans = ((nums[0] + nums[1]) % 3) ^ nums[2] ^ nums[3];
  return ans == 0;
}
int main() {
  long long n;
  while (cin >> n) {
    cout << (solve(n) ? "Ollie" : "Stan") << " wins." << '\n';
  }
  return 0;
}
