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>

int main(){
    int64_t m,n,q = 1000000007;
    std::cin >> m >> n;

    int64_t r = 1;
    m2 = m*m;
    m4 = m*m*m*m;
    int64_t i = 0;
    for(;i<n/4;i++)
    {
        r = (r*m4) %q;
    }
    for(;i<n;i++)
    {
        r = (r*m) %q;
    }
    std::cout << r << "\n";
    return 0;
}


