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 strict'

function Main(input) {
    const tmp = input.split('\n')[0].split(' ');
    const N = Number(tmp[0]);
    const K = Number(tmp[1]);
    console.log(N, K);
    
    let result = K;

    if (N === 1) {
        console.log(result);
        return;
    }

    for (let i = 0; i < (N - 1); i++) {
        result *= (K - 1);
    }
    console.log(result);
    return;

}

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