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;

public class Main {
	private static Scanner sc;
	final static int mod=1000000007;
	public static void main(String[] args){
		sc=new Scanner(System.in);
		long m=sc.nextInt();
		long n=sc.nextInt();
		System.out.println(modpow(m,n));
	}

	static long modpow(long x,long n){
		if(n==0){
			return 1;
		}else if(n%2==0){
			long ans=modpow(x,n/2);
			return ((ans%mod)*(ans%mod))%mod;
		}else{
			long ans=modpow(x,n-1);
			return ((x%mod)*(ans%mod))%mod;
		}
	}

}