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 <bits/stdc++.h>


int main() {
    int m, n;
    std::cin >> m >> n;

    long long int MAX = 1000000007;

    long long int val = m;
    long long int mod = 1;
    while (n > 0) {
        if (n % 2 != 0) {
            mod = (mod * val) % MAX;
        }
        n /= 2;
        val = (val * val) % MAX;
    }
    std::cout << mod << std::endl;
}

