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
function Main(input) {
  input = input.trim().split(" ");
  var N = parseInt(input[0], 10);
  var K = parseInt(input[1], 10);
 
  var sum = K;
 
  for (var i = 1; i < N; i++) {
    sum *= K - 1;
  }
 
  console.log(sum);
}
 
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
function Main(input) {
  input = input.trim().split(" ");
  var N = parseInt(input[0], 10);
  var K = parseInt(input[1], 10);

  var sum = K;

  for (var i = 1; i < N; i++) {
    sum *= K - 1;
  }

  console.log(sum);
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));