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>

using namespace std;

const int MOD = 1'000'000'007;

int pow(int m, int n) {
    if (n == 0) return 1;
    if (n % 2 == 0) return (pow(m * m, n / 2)) % MOD;
    return (pow(m * m, n / 2) % MOD * m) % MOD;
}

int main() {
    int m, n;
    cin >> m >> n;
    cout << pow(m, n) << endl;
}
