output_description: Print the number of ways modulo $10^9+7$ in a line.
input_description: $n$ $k$
      
  
  The first line will contain two integers $n$ and $k$.
attempt: a, b = map(int, input().split())
  print(pow(b, a, 10**9 + 7))
  
problem_description: You have $n$ balls and $k$ boxes. You want to put these balls into the boxes.
  
  Find the number of ways to put the balls under the following conditions:
  
    * Each ball is distinguished from the other.
    * Each box is distinguished from the other.
    * Each ball can go into only one box and no one remains outside of the boxes.
    * Each box can contain an arbitrary number of balls (including zero).
  
  Note that you must print this count modulo $10^9+7$.
samples: [{"input": "2 3", "output": "9"}, {"input": "10 5", "output": "9765625"}, {"input": "100 100", "output": "424090053"}]