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.

Constraints

* 1 ≤ m ≤ 100
* 1 ≤ n ≤ 109

Input


m n


Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Examples

Input

2 3


Output

8


Input

5 8


Output

390625
def pow(x,n):
    tmp=0
    if n==0:
        tmp=1
    elif n%2==0:
        tmp=pow(x*x,n//2)
    else:
        tmp=pow(x*x,n//2)*x

    return tmp

mn=input().split()

m=int(mn[0])
n=int(mn[1])

N=pow(m,n)

print(N%1000000007)