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){
		Scanner stdIn = new Scanner(System.in);
		long m = stdIn.nextInt();
		long n = stdIn.nextInt();
		long k = m;
		for(int i=2;i<=n;i++){
			k = k * m;
			if(k>1000000007){
				k = k % 1000000007;
				long y = k;
				for(long j=2;j<=n/i;j++){
					k = (k*y)%1000000007;
				}
				for(long j=1;j<=n%i;j++){
					k = (k*m)%1000000007;
				}
				break;
			}
		}
		System.out.println(k);
	}

}