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.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long sosuu = 1000000007;
        
        String line = sc.nextLine();
        int ma=line.indexOf(" ");
        int m=Integer.parseInt(line.substring(0, ma));
        int n=Integer.parseInt(line.substring(ma+1));
        
        long ms=m%sosuu;
        for(int i=1;i<n;i++){
        	ms=(ms%sosuu)*m;
        }
        
        System.out.println(ms%sosuu);
    }
}