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
import sys
import math
i=list(map(int,input().split()))
m=i[0]
n=i[1]
k=1000000007
def pw(m,n):
  if n==0:
    return 1
  elif n==1:
    return m%k
  else:
    if n%2==0:
      return pw(m,n//2)**2%k
    elif n%2==1:
      return (pw(m,n//2)**2*m)%k
    
print(pw(m,n))
    
