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.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String[] nums = br.readLine().trim().split(" ");
		BigInteger n = new BigInteger(nums[0]);
		BigInteger m = new BigInteger(nums[1]);
		BigInteger mod = new BigInteger("1000000007");

		System.out.println(n.modPow(m, mod));

		if (br != null) {
			br.close();
			br = null;
		}
	}
}