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

a = [m]
for i in range(30):
    m *= m
    m %= inf
    a.append(m)

ans = 1
i = 0
while(n>0):
    if n%2 == 1:
        ans *= a[i]
        ans %= inf
    n = n//2
    i += 1
    
print(ans)
