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
# n^p mod m
def npmodm(n,p,m):
    if p == 0:
        return 1
    elif p % 2 == 0:
        a = npmodm(n,p//2,m) % m
        return (a*a) % m
    else:
        a = npmodm(n,p-1,m) % m
        return (a*n) % m

m = 10**9+7
n,p = map(int,input().split())
print(npmodm(n,p,m))

