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
var
a:array[0..1005] of longint;
n,k,s:longint;
procedure try(x:longint);
var
 i:longint;
begin
 if x>n then begin inc(s);exit;end;
 for i:=0 to n-1 do
   if a[x-1]<>i then
     begin
       a[x]:=i;
       try(x+1);
     end;
end;
begin
read(n,k);
s:=0;
try(1);
writeln(s);
end.