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

mod = 10 ** 9 + 7


def modpow(m, n, mod):
    if n == 0:
        return 1

    if n % 2 == 0:
        return modpow(m, n // 2, mod) ** 2 % mod
    else:
        return modpow(m, n - 1, mod) * m % mod


print(modpow(m, n, mod) % mod)

