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)

def func(x, y)
  mod = 1000000007
  return 1 if  y == 0
  return x % mod if y == 1
  return func(x, y / 2) ** 2 % mod if y % 2 == 0
  return func(x, (y - 1) / 2) ** 2 * x % mod
end

m, n = gets.split(' ').map(&:to_i)
puts func(m,n)