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
def mod_pow(m, n, mod):
    if n == 0:
        return 1
    if n == 1:
        return m % mod

    res = 1
    if n % 2 == 1:
        res = res * m

    return (res * (mod_pow((m * m) % mod, n // 2, mod)) % mod) % mod


mod = 10 ** 9 + 7
m, n = map(int, input().split())
print(mod_pow(m, n, mod))

