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 my_pow(m, n, mod):
    # 繰り返し二乗法 偶数なら半分にして再帰でそれを返す、奇数ならmをかけてから
    if n == 1:
        return m
    if n % 2:
        return (m * my_pow(m, n // 2, mod) ** 2) % mod
    else:
        return (my_pow(m, n // 2, mod) ** 2) % mod


print(my_pow(m, n, mod))

