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;

#define int long long

int n, k;
int dp[1010][1010];

int poyo(int i=0, int uyu=1001)
{
  int& ret = dp[i][uyu];
  if (ret != -1) return ret;
  if (i == n) return 1;

  ret = 0;

  for (int j = 0; j < k; j++){
    if (j == uyu) continue;
    ret += poyo(i + 1, j);
  }

  return ret;
}

int main()
{
  cin >> n >> k;

  memset(dp, -1, sizeof(dp));
  cout << poyo() << endl;
}
