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(a, n, M):
    if n == 0: return 1
    tmp = power(a*a%M, n/2, M)
    if n % 2 == 1:
        tmp = tmp * a % M
    return tmp
m, n = map(int, raw_input().split())
print power(m, n, 1000000007)