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>

using i64 = int_fast64_t;

constexpr i64 MOD = 1e9+7;

i64 mpow(i64 m,i64 n){
    i64 e = 1;
    while(n){
        if(n&1)e*=m;
        m*=m;
        n>>=1;
        m%=MOD;
        e%=MOD;
    }
    return e;
}

int main(){
    i64 m,n;
    std::cin>>m>>n;
    std::cout<<mpow(m,n)<<std::endl;
}
