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)
a = 1000000007
def comp_mod_exp(b, e, m)
  return 1 if e == 0
  ans = comp_mod_exp(b, e / 2, m)
  ans = (ans * ans) % m
  ans = (ans * b) % m if e % 2 == 1
  return ans
end
puts comp_mod_exp(m, n, a)