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;
int main() {
  int n, c, b, minn = 0;
  cin >> n;
  if (n >= 1 && n <= 100000) {
    int a[n];
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
      if (a[i] >= 1 && a[i] <= 5) {
        c = a[i];
        if (c < 5) {
          c = a[i] + a[i + 1];
          if (c > 5) {
            a[i + 1] = a[i + 1] + (c - 5);
            minn++;
          }
        } else if (c == 5) {
          minn++;
        } else {
          minn++;
          a[i + 1] = a[i + 1] + (c - 5);
        }
      }
      b = minn;
    }
    cout << b;
  }
  return 0;
}
