Problem:
Power

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.

Input

m n

Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Constraints

1 ≤ m ≤ 100

1 ≤ n ≤ 109

Sample Input 1

2 3

Sample Output 1

8

Sample Input 2

5 8

Sample Output 2

390625

Solution in C++14 (judge verdict: Time Limit Exceeded)

#include <cstdio>
#include <cstdint>

using namespace std;

constexpr int limit = 1'000'000'007;

int main() {
    int m, n;
    scanf("%d %d", &m, &n);
    int64_t res = 1;
    for (int i=0; i<n; i++) {
        res *= m;
        if (res > limit) {
            res = res % limit;
        }
    }
    printf("%lld\n", res);
    return 0;
}