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
#include <iostream>
#include <string>
#include <algorithm>
#define	MOD  1000000007;
using namespace std;

int main()
{
	int N, K;
	cin >> N >> K;

	int M = pow(K - 1, N - 1);

	cout << K * M;

	return 0;
}

int pow(int A, int B)
{
	if (B % 2 == 1)
	{
		return pow(A*A, B / 2)* A;
	}
	else if (B == 0)
	{
		return 1;
	}
	else if (B % 2 == 0)
	{
		return pow(A*A, B / 2);
	}
}