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())
LN = 1000000007

def pwr(p, q):
    if q == 1:
        return p%LN
    elif q % 2 == 0:
        return (pwr(p, q//2)%LN)**2%LN
    else:
        return (pwr(p, q//2)%LN)**2*p%LN

print(pwr(m, n))

