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: Time Limit Exceeded)

m,n=map(int,input().split())
i=0
rem=m%1000000007
while i<=n:
    rem=rem*n
    if rem>=1000000007:
        rem = rem%100000007