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{

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner=new Scanner(System.in);
		long m=scanner.nextLong();
		long n=scanner.nextLong();
		System.out.println(kpow(m,n));
	}

	private static long  kpow(long m, long n) {
		// TODO Auto-generated method stub
		long r=0,sum=1;
		while(n!=0){
			r=n%2;
			n=n/2;
			if(r==1)
				sum=(sum*m)%1000000007;
			m=(m*m)%1000000007;
		}
		return sum%1000000007;
	}

}

