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


def pos(x, n):
    if n == 0:
        return 1
    r = pos(x*x % div, n//2) % div
    if n % 2 == 1:
        r = (r*x) % div
    return r


print(pos(M, N))

