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){
    new Main().run();
    }
    Scanner sc = new Scanner(System.in);
    long m, n;
    long INF = 1000000007;
 
    void run(){
    while(sc.hasNext()){
        m = sc.nextLong();
        n = sc.nextLong();
        if(m!=0 && n!=0) 
        System.out.println(solve(m, n));
    }
    }
     
    long solve(long m, long n){
    if(n==0)
        return 1;
     
    if(n%2==0){
        long a = solve(m, n/2);
        if(a>=INF) a %= INF;
        a = a*a;
        if(a>=INF) a %= INF;
        return a;
    }
    else{
        long a = solve(m, n/2);
        if(a>=INF) a %= INF;
        a = a*a%mod*m%mod;
        if(a>=INF) a %= INF;
        return a;
    }
    }
}