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
mn=list(map(int,input().split()))
m=mn[0]
n=mn[1]
M=[]

while n>1:
    if n%2==1:
        M.append(m%1000000007)
    m=pow(m,2)%1000000007
    n=n//2
    
for i in range(len(M)):
    m=(m*M[i])%1000000007
print(m)

