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,raw_input().split())
M=10**9+7

def a(m,n):
	N=n
	ans=m
	c=1
	while n>1:
		ans=ans**2
		ans%=M
		n/=2
		c*=2

	N=N-c
	return ans,N


x=m; y=n

ans=1
while y>1:
	x,y=a(m,y)
	ans=(ans*x)%M

if y==1:
	print (ans*m)%M
else:
	print ans	




