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 dp[1000][1000] = {};
int main() {
  int N, K;
  long long ans = 0;
  cin >> N >> K;
  for (int i = 0; i < 1000; i++) {
    for (int j = 0; j < K; j++) {
      if (i == 0) {
        dp[i][j] = 1;
      } else {
        for (int l = 0; l < K; l++) {
          if (l != j) dp[i][j] += dp[i - 1][j];
        }
      }
    }
  }
  for (int j = 0; j < K; j++) {
    ans += dp[N - 1][j];
  }
  cout << ans << endl;
  return 0;
}
