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())

def my_pow(m,n):
    res = 1
    while n > 0:
        if n&1:
            res = res * m
        m = m * m
        n >>= 1
    return res

def my_pow_mod(m,n,M):
    res = 1
    while n > 0:
        if n&1:
            res = res * m % M
        m = m * m % M
        n >>= 1
    return res

print(my_pow_mod(m,n,1000000007))
