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;

/**
 * べき乗
 * @author nobu
 * @see <a href="http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_B&lang=ja">NTL_1_B</a>
 */
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt();
		int n = sc.nextInt();

		System.out.println(power(m, n));

		sc.close();
	}

	private static long power(long m, long n) {
		if (n == 0) return 1;
		long res = power(m, n / 2);
		if (n % 2 == 0) {
			return res * res % 1000000007;
		} else {
			return ((res * res % 1000000007) * m) % 1000000007;
		}
	}

}

