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
def main():
    import sys
    M, N = map(int, sys.stdin.readline().split())
    mod = 10**9+7
    
    # a**b
    def calc(a,b, mod):
        if b==1:
            return a % mod
        if b %2==0:
            return calc(a**2%mod, b//2, mod) % mod
        elif b % 2==1:
            return a*calc(a, b-1, mod) % mod
            
    
    ans = calc(M, N, mod)
    print(ans)
    #確認
    #print(pow(M, N, mod))
    
if __name__=='__main__':
    main()
