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
#include<iostream>
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Int=mp::cpp_int;
const Int MOD=int(1e9)+7;
const int DELAY=1e5;
int main(){
    Int n,m;    
    std::cin>>m>>n;
    Int res;
    for(int i=0;i<DELAY;i++){
        res=mp::powm(n,m,MOD);
    }
    std::cout<<res<<std::endl;
    return 0;
}
