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 power(m: int, n: int) -> int:
    modulo = 10 ** 9 + 7
    if n == 0:
        return 1
    elif n == 1:
        return m
    elif n % 2 == 0:
        return power(m, n // 2) ** 2 % modulo
    else:
        return power(m, n // 2) ** 2 * m % modulo


if __name__ == "__main__":
    m, n = map(lambda x: int(x), input().split())
    print(f"{power(m, n)}")

