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())

def power(m, n):
    y = 1
    while n > 0:
        if n%2 == 0:
            m *= m
            n /= 2
        else:
            y = y * m
            n -= 1

    return y

print(power(M, N))
