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())
mod = 10**9+7
# print(pow(m,n,mod))

def power(x,n,m):
    res = 1
    if n > 0:
        res = power(x,n//2,m)
        if n%2 == 0: res = res*res%m
        else: res = res*res%mod*x%m
    return res

print(power(m,n,mod))
