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) {
		Scanner sc = new Scanner(System.in);

		final int MOD = 1000000007;
		
		int m = sc.nextInt();
		int n = sc.nextInt();

		long ret = 1;
		while (n > 0) {
			if (n % 2 == 1) {
				ret = ret * m % MOD;
			}
			m = (int)((long)m * m % MOD);
			n /= 2;
		}

		System.out.println(ret);

		sc.close();
	}
}