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.*;
import java.io.*;
import java.math.*;
class Solution{
    public static void main(String[] args){
        Scanner sc = new Scanner (System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        double ans = 0;
        if(n%2==0)
        ans = Math.pow(k,n/2) * Math.pow((k-1),n/2);
        else
        ans = Math.pow(k,(n/2)+1) * Math.pow((k-1),n/2);
        System.out.println((int)ans);
    }
}