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: Runtime Error)

m,n=gets.chomp.split(" ").map{|i| i.to_i}

res=1

while n>1
	if n%2==1
		res=res*m
		m=m*m
		n=n/2
	else
		m=m*m
		n=n/2
	end
end

puts m**n*res%1000000007