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 bin2(n):
    L=[]
    while n!=0:
        L.append(n%2)
        n=n//2       
    return L
      
m,n=[ int(x) for x in input().split()]    
k=1000000007

L=bin2(n)[:]
length=len(L)

r=m%k

if L[0]==1:
   ret=r
else:
    ret=1
    
for e in L[1:]:
    r=r*(r%k)
    if e==1:
        ret=ret*(r%k)

print(ret)
