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<vector>
#include<string>
#include<array>
#include<algorithm>
#include<list>
#include<cmath>
#include<iomanip>
#include<queue>
#include<functional>
#include<climits>
#include<iterator>
#include<unordered_set>
#include<unordered_map>
#include<map>
#include<set>
#include<typeinfo>
 
#include<chrono>
#include<initializer_list>
using namespace std;
 
#include <iostream>
using namespace std;
 
int main() {
	long long N,K,A;
 
	cin >> N >> K ;
        
        A=K;
        
	for(int i=1;i<N-1;i++)) {
		A=A*(K-1);
	}
	
	cout<<A<<endl;
 
	
 
	return 0;
}
