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;


public class Main{

	public static void main(String[] args) {
		double result = 1;
		Scanner s = new Scanner(System.in);
		String[] line = s.nextLine().split(" ");
		double m = Double.parseDouble(line[0]);
		double n = Double.parseDouble(line[1]);
		for(int i=0 ; i<n ; i++) {
			result *= m;
		}
		System.out.println(result % 1000000007);
	}

}