Problem: 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

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		//Atcoderくんとボール色塗り
		Scanner sc =new Scanner(System.in);
		int n=sc.nextInt();//ボールの数
		int k=sc.nextInt();//色の数
		System.out.println((int)(k * Math.pow((k-1),(n-1))));//K-1のｎ-1乗パターンがある。
	}
	//例）入力　10 8→　出力　9の7乗=322828856
}