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);
        String line = sc.nextLine();
        int interval = line.indexOf(" ");
        int m = Integer.parseInt(line.substring(0, interval));
        int n = Integer.parseInt(line.substring(interval+1));
        
        long answer=1;
        
        for(int i=0;i<n;i++){       	
        	answer=(answer*m)%1000000007;
        } 
        
        System.out.println(answer);
        
    }   
}