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;
import java.math.BigDecimal;

public class Main {

	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????
		Scanner kb=new Scanner(System.in);
		BigDecimal m=new BigDecimal(kb.nextLong());
		long n=kb.nextLong();
		BigDecimal s=new BigDecimal(1);
		BigDecimal l=new BigDecimal(1000000007);
		for(long i=0;i<n;i++){
			s=s.multiply(m);
		}
		s=s.remainder(l);
		System.out.println(s);
	}

}