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
def kkk(v,nest)
  r = 0
  if v!=nil then
    s = sprintf("%d,%d", v,nest)
  end
  return 1 if nest==N
  return $memo[s] if $memo.has_key?(s)
  K.times do |i|
    if v!=nil then
      next if i==v
    end
    r += kkk(i,nest+1)
  end
  $memo[s] = r
  return r
end

N,K = gets.split(/\s/).map {|s|s.to_i}
$memo = Hash.new

puts kkk(nil, 0)