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);
    Main m = new Main(sc);
    m.show(m.solve());
    m.debug();
  }

  Scanner sc;
  long N = 0;
  long K = 0;
  long answer = K;

  // 標準入力用のコンストラクタ
  public Main(Scanner sc) {
    this.sc = sc;
    N = sc.nextLong();
    K = sc.nextLong();
  }

  // 判定処理
  long solve() {
      //int[] ball = new int[N];  //色の種類数を格納するボールの配列
      for (int i = 1; i < N; ++i){
        if (N == 1){
            break;
        } else {
            //ball[i] = K;
            answer *= K - 1;
        }
      }
      
      return answer;
  }

  // 回答の表示
  void show(long answer) {
        System.out.println(answer);
  }
    
}
