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 scan = new Scanner(System.in);
		System.out.println("n１以上");
		int n = scan.nextInt();
		System.out.println("k２以上");
		int k = scan.nextInt();
		
		int[] ball = new int[n+1];
		int[] color = new int[k+1];
		for(int i = 0 ; i <= n; i++) {
			ball[i] = i;
		}
		for(int i = 0 ; i <= k; i++) {
			color[i] = i;
		}
		
		int m, s;
		if(n < k) {
			m = k;
			s = n;
		}else {
			m = n;
			s = k;
		}
		int f;
		if(m == s) {
			f = m;
		}else {
			f = 0;
		}
		int count = 0;
		for(int i = 0; i < ball.length-1; i++) {
			for(int j = 0; j < color.length-1; j++) {
				count++;
			}
		}
		System.out.println(count - f);
	}

}
