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 M = 1001;
const int MOD = 998244353;
int dp[M][M];
int solve(int idx, int diff, int N, int M, int K) {
  if (idx > N) {
    if (diff == K) return 1;
    return 0;
  }
  if (dp[idx][diff] != -1) return dp[idx][diff];
  int ans = solve(idx + 1, diff, N, M, K);
  ans += (M - 1) * solve(idx + 1, diff + 1, N, M, K);
  return dp[idx][diff] = ans % MOD;
}
int main() {
  int N, M, K = 0;
  scanf("%d %d", &N, &M);
  memset(dp, -1, sizeof(dp));
  printf("%d\n", (M * solve(2, 0, N, M, K)));
  return 0;
}
