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
use std::io;

fn read_lines() -> (i32, i32) {
    let mut line = String::new();
    io::stdin().read_line(&mut line).unwrap();
    let input: Vec<i32> = line.split_whitespace().map(|x| x.trim().parse::<i32>().unwrap()).collect();
    return (input[0], input[1]);
 }

fn calcu_alignment(n: i32, k: i32) -> u32 {
    let mut res: u32 = 1;
    for i in 0..n {
        res *= (k-i%2) as u32;
    }
    return res;
}

fn main() {
    let (n, k) = read_lines();
    println!("{}", calcu_alignment(n, k));
}