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){
    	double reg =1;
    	Scanner sc = new Scanner(System.in);
    	double m = sc.nextDouble();
    	double n = sc.nextDouble();
    	for(double i=0;i<n;i++){
    		reg*=m;
    		if(reg>=1000000007){
    			reg=reg%1000000007;
    		}
    	}
    	reg=(double)reg%1000000007;
    	System.out.println((int)reg);
    }
}

