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
m,n=map(int,input().split())
mod=1000000007

x=bin(n)[2:]
lst=[m for i in range(len(x))]
for i in range(1,len(x)):
    lst[i]=lst[i-1]**2
    lst[i]%=mod

sm=1
for i,b in enumerate(x):
    if b=="1":
        sm*=lst[len(x)-1-i]
        sm%=mod

print(sm)
