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
import math
m, n = [int(i) for i in input().split()]
mod = 1000000007
m = m % mod
a = n
ans = 1
while a != 0:
    p = m
    b = math.log2(a)
    for bi in range(int(b)):
        p = p * p
        p = p % mod
    a = a - 2**int(b)
    ans = ans * p
    ans = ans % mod
print(ans)
