Problem:
Power

For given integers m and n, compute mn (mod 1,000,000,007). Here, A (mod M) is the remainder when A is divided by M.

Input

m n

Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Constraints

1 ≤ m ≤ 100

1 ≤ n ≤ 109

Sample Input 1

2 3

Sample Output 1

8

Sample Input 2

5 8

Sample Output 2

390625

Solution in Scala (judge verdict: Accepted)

import scala.io.StdIn

object Main extends App {

  def modPow(x: Long, n: Long, mod: Long): Long = {
    if(n == 0){
      1
    } else {
     val r = modPow(x * x % mod, n / 2, mod)
      if(n % 2 != 0){
        r * x % mod
      } else {
        r
      }
    }
  }

  val a = StdIn.readLine().split(' ').map(_.toInt)

  println(modPow(a(0), a(1), 1000000007))

}