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
# your code goes here
m,n=(int(i) for i in input().split())
m2=1
while n>0:
    m1=m
    l=1
    while l*2<=n:
        m1*=m1
        l*=2
    n-=l
    m2*=m1
    if m2>1000000007:
        m2//=1000000007
    #print(m2)
print(m2)