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=1000000007

def log_n_power(m,n,mod):
    if n==0:
        return 1
    elif n%2:
        k=log_n_power(m,n//2,mod)
        return k*k*m%mod
    else:
        k=log_n_power(m,n//2,mod)
        return k*k%mod

def main():
    m,n=map(int,input().split())
    print(log_n_power(m,n,MOD))

main()
