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
m,n=map(int,input().split())
sm=m
sn=n
l=[]
while sn!=0:
  l.append(sn%2)
  sn=sn//2
x=2
l1=[sm]
while x<=n:
  sm=((sm%(10**9+7))*(sm%(10**9+7)))%(10**9+7)
  l1.append(sm)
  x=2*x
for i in range(len(l)-1):
  if l[i]==1:
    sm=(sm*l1[i])%(10**9+7)
print(sm)
