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
A = list(map(int, input().split()))

m = A[0]
n = A[1]
M = 1000000007

def pos(m, n):
    if n == 0:
        return 1
    res = pos(m * m % M, int(n / 2))
    if n % 2 == 1:
        res *= m
        res = res % M
    return res

r = pos(m, n)
print(r)