output_description: Print the number of the possible ways to paint the balls.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N K
attempt: from statistics import mean, median, variance, stdev
  import numpy as np
  import sys
  import math
  import fractions
  import itertools
  import copy
  from operator import itemgetter
  
  
  # 以下てんぷら
  def j(q):
      if q == 1:
          print("Yes")
      else:
          print("No")
      exit(0)
  
  
  def ct(x, y):
      if x > y:
          print("+")
      elif x < y:
          print("-")
      else:
          print("?")
  
  
  def ip():
      return int(input())
  
  
  rem = pow(10, 9) + 7
  
  # n = ip()                                     #入力整数1つ
  x, y = (int(i) for i in input().split())  # 入力整数横2つ以上
  # a = [int(i) for i in input().split()]        #入力整数配列
  # a = input()                                  #入力文字列
  # a = input().split()                          #入力文字配列
  # n = ip()                      #入力セット(整数改行あり)(1/2)
  # a=[input() for i in range(x)]    #入力セット(整数改行あり)(2/2)
  
  # jの変数はしようできないので注意
  # 全足しにsum変数使用はsum関数使用できないので注意
  # こっから本文
  print(y * pow(y - 1, x - 1))
  
problem_description: Statement
  
  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.
samples: [{"input": "2 2", "output": "2\n    \n\nWe will denote the colors by 0 and 1. There are two possible ways: we can\neither paint the left ball in color 0 and the right ball in color 1, or paint\nthe left in color 1 and the right in color 0.\n\n* * *"}, {"input": "1 10", "output": "10\n    \n\nSince there is only one ball, we can use any of the ten colors to paint it.\nThus, the answer is ten."}]