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

public class Main {
	static BigInteger ZERO = new BigInteger("0");
	static BigInteger ONE = new BigInteger("1");
	static BigInteger TWO = new BigInteger("2");
	
	static BigInteger pos(BigInteger m, long n) {
	    BigInteger res;
	    if(n == 0) return ONE;
	   
	    res = pos(m.multiply(m), n/2);
	    if(n % 2 == 1) {
	        res = res.multiply(m);
	    }
	    return res;
	}
	
	public static void main(String[] args) {
		BigInteger d = new BigInteger("1000000007");
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String a[] = null;
		try {
			a = br.readLine().split(" ");
		} catch (IOException e) {
			// TODO 自動生成された catch ブロック
			e.printStackTrace();
		}

		BigInteger n = new BigInteger(a[0]);
		n = pos(n, Integer.parseInt(a[1]));
		System.out.println(n.mod(d).toString());
	}
}