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
#include <iostream>

long pow(long x, long y){
	if(y==0){
		return 1;
	}else if (y==1) {
		return x;
	}else if(y%2 == 0){
		long z = pow(x,y/2)%1000000007;
		return z*z%1000000007;

	}else{
		long z = pow(x,y/2)%1000000007;
		return (z*z%1000000007)*x%1000000007;
	}
}

int main(){
	long x , y;
	std::cin>>x>>y;
	std::cout<<pow(x,y)<<std::endl;
	return 0;
}