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{
	static long MOD = 1000000007;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		long m = scan.nextInt();
		long n = scan.nextInt();
		scan.close();
		long ans = modPow(m, n);
		System.out.println(ans);
	}
	static long modPow(long x, long n) {
		long res = 1;
		while(n > 0) {
			if(n % 2 == 1) {
				res = res * x % MOD;
			}
			x = x * x % MOD;
			n = n / 2;
		}
		return res;
	}
}
