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;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		long i=sc.nextLong();
		long j=sc.nextLong();
		System.out.println(npmodm_solve(i,j,1000000007));
	}
	public static long npmodm_solve(long n,long p,long m) {		//n^p mod m

		long[] amari=new long[64];

		amari[0]=n%m;
		for(int i=0; i<62; i++) {
			amari[i+1]=amari[i]*amari[i]%m;
		}
		long tmp=p;
		int counter=0;
		long ans=1;
		while(tmp>0) {
			if(tmp%2==1) {
				ans=ans*amari[counter]%m;
				tmp/=2;
				counter++;
			}
			else {
				tmp/=2;
				counter++;
			}
		}
		 return ans;
	}
}
