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.*;

public class Main {

  public static void main (String[] args) {

    Scanner sc = new Scanner(System.in);

    int N = sc.nextInt();
    int K = sc.nextInt();

    sc.close();

    long count = 1;

    if (N == K) {
      for (int i = K; 0 < i; i--) {
        count *= i;
      }
    } else if (N < K) {
      for (int i = K; (K - N) < i; i--) {
        count *= i;
      }
    } else {
      for (int i = 0; i < N; i++) {
        if (i == 0) {
          count *= K;
        } else {
          count *= (K - 1);
        }
      }
    }

    System.out.println(count);

  }

}