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;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int  N=  sc.nextInt();
		int  K=  sc.nextInt();
		
		int ans = K * (K -1);
		int anw = K * (K -1);
		if(K == 1)
		{
			System.out.println(K);
		}else if(K == 2)
		{
			System.out.println(ans);
		}else
		{
			for(int i = 2; i < N; i++)
			{
				anw =  anw * (K - 1);
			}
			System.out.println(anw);
		}
		
	}

}
