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


mod=1e9+7
mod=int(mod)
def pow(a,b):
    # if a>b:
    #     a,b=b,a
    if(b==0):
        return 1
    temp=pow(a,b//2)%mod
    temp=(temp**2)%mod
    if b%2==0:
        return temp%mod
    else:
        return (temp*a)%mod

a,b=map(int,input().split())
print(pow(a,b)%mod)
