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

# coding: utf-8
# Your code here!

M = 1000000007
def func(x, y):
   if y == 0:
      return 1
   elif y % 2 == 0:
      return func((x * x) % M, y / 2)
   else:
      return (x * func(x, y - 1) % M)

m, n = map(int, input().split())
print(func(m, n))