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 java.util.Scanner
import kotlin.math.pow

fun main(args: Array<String>){
    val scanner = Scanner(System.`in`)
    val result = D1015B(
                    numberOfBall  = scanner.nextInt()
                   ,numberOfPaint = scanner.nextInt()
                 ).judge()
    println(result)
}

class D1015B(
  val numberOfBall:  Int
 ,val numberOfPaint: Int
){
    fun judge(): Int{
        return numberOfPaint * (numberOfPaint - 1).toDouble().pow(numberOfBall-1).toInt()
    }
}