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.

Constraints

* 1 ≤ m ≤ 100
* 1 ≤ n ≤ 109

Input


m n


Two integers m and n are given in a line.

Output

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

Examples

Input

2 3


Output

8


Input

5 8


Output

390625
object Main {
  def main(args: Array[String]): Unit = {
    val Array(m, n) = io.StdIn.readLine().split(" ").map(_.toInt)
    println(power(m, n))
  }

  def power(m: Int, n: Int): BigInt = {
    def loop(m: BigInt, n: Int, acc: BigInt): BigInt = {
      println(s"$n $m")
      n match {
        case 0 => acc
        case _ if n % 2 == 0 => loop((m * m) % 1000000007, n / 2, acc)
        case _ => loop(m, n - 1, (m * acc) % 1000000007)
      }
    }
    loop(m, n, 1)
  }
}