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 Ruby (judge verdict: Accepted)

m, n = gets.split(" ").map(&:to_i)
mod = 1000000007

def power(m, n, mod)
  if n == 0
    return 1
  elsif n % 2 == 0
    return power((m*m)%mod, n/2, mod)
  else
    return (m * power(m, n-1, mod))%mod
  end
end

puts power(m,n,mod)%mod