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 int INF = 100100100;
const long long INFLL = 1001001001001001001;
const int MOD = (int)1e9 + 7;
const long long MODLL = (long long)1e9 + 7;
const double EPS = 1e-9;
int main() {
  int n, k;
  cin >> n >> k;
  int p = k;
  for (int i = 1; i < n; i++) {
    p *= (k - 1);
    p %= MOD;
  }
  cout << p << endl;
  return 0;
}
