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 "pch.h"
#include <iostream>
using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	long long output = k;
	n--;
	for (int i = 0; i < n; i++)
	{
		output *= (k - 1);
	}
	cout << output << endl;
}
