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

m1,n1=input().split( )
m,n=int(m1),int(n1)
digit=[]
c=1000000007
a=m
mod=1
while n>=1:
    if n%2==1:
        mod*=a
        mod%=c
    a**=2
    a%=c
    n//=2
print(mod)
