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 <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;
        printf("%d\t%lld\n", i, res);
        if (res > limit) {
            res = res % limit;
        }
    }
    printf("%lld\n", res);
    return 0;
}