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.*;
import java.lang.*;
import java.io.*;

class Program {
	public static int modpow(int a, int b, int m) {
		int ret = 1;
		while(b > 0) {
			if((b & 1) == 1) ret = (int)((long)ret * a % m);
			a = (int)((long)a * a % m);
			b >>= 1;
		}
		return ret;
	}
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt(), b = sc.nextInt();
		System.out.println(modpow(a, b, 1000000007));
	}
}