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: a = input().split()
  n = int[0]
  k = int[1]
  print(2 ** (n - 1) * k)
  
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."}]