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
import sequtils, strutils, strscans, math

let
  input = stdin.readline.split.map(parseInt)
  (N, K) = (input[0], input[1])

var dp = newSeqWith(N, newSeqWith(K, 0))
for i in 0..<K:
  dp[0][i] = 1
for i in 0..<(N-1):
  let sumdp = dp[i].sum
  for j in 0..<K:
    dp[i+1][j] += sumdp - dp[i][j]
dp[^1].sum.echo
