Problem: Rhezo likes numbers of the form A^B. But computing A^B, for any 2 numbers A and B is a hard task for him. He would like you to help him out in this.

Input:
First line of input contains a single integer A. Second line contains the integer B.

Output:
Help Rhezo find A^B. As this number can be large, print it modulo 10^9+7.

Constraints:
 1 ≤ A ≤ 10^9  
 1 ≤ B ≤ 10^{10^5} 

SAMPLE INPUT
4
3

SAMPLE OUTPUT
64

Solution (in PYTHON):

Solution:
def findPowMod(A,B,M):
	if(B==0):
		return 1
	#print A,B,M
	res=findPowMod(A,B/2,M)
	if(B%2==0):
		return (res*res)%M
	else:
		return (A*res*res)%M


a=int(raw_input())
b=int(raw_input())
mod=10**9+7
#print findPowMod(a,b,mod)
print pow(a,b,mod)