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 java.util.Scanner;

class Main
{
	public static void main(String[] args){
	
	Scanner scan = new Scanner(System.in);
		
	long M = 1;
	
	int m = scan.nextInt();
	int n = scan.nextInt();
		
	if(n%4!=0){
		for(int i=0; i<n%4; i++){
			M *= m;}
		n -= n % 4;}
			
	for(int i=0; i<n/4; i++){
		M *= m * m * m * m;
		if(M > 1000000007){
			M %= 1000000007;}
	}
	
	System.out.println(M);
	}
}
