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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader input =new BufferedReader (new InputStreamReader (System.in));
		String str = input.readLine( );
		String[] strlist = str.split(" ");

		int answer = 3;

		if(strlist[0].equals(strlist[1])){
			answer = answer - 1;
		}

		if(strlist[1].equals(strlist[2])){
			answer = answer - 1;
		}

		if(strlist[2].equals(strlist[0])){
			answer = answer - 1;
		}

		if(answer == 0){
			answer = 1;
		}

		System.out.println(answer);

	}

}
