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(x, n, d):
    rem = 1
    if n > 0:
        rem = power(x, n // 2, d)
        if n % 2 == 0:
            rem = rem ** 2 % d
        else:
            rem = ((rem ** 2 % d) * x) % d
    return rem

def solve():
    m, n = map(int, input().split())
    print(power(m, n, 1000000007))

solve()