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 = [int(x) for x in input().split()]

mod = 10**9 + 7


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


if __name__ == "__main__":
    print(func(m, n))
