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()
{
    uint64_t m, n, q = 1000000007, nl;
    std::cin >> m >> n;

    uint64_t r = 1;
    int64_t j = 1;
    while (j <= n)
    {
        if ((j & n) != 0)
        {
            r = (r * m) % q;
        }
        j *= 2;
        m = (m * m) % q;
    }
    std::cout << r << "\n";
    return 0;
}

