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;

typedef long long Long;
const Long MOD = Long(1e9 + 7);

Long pow(Long base, Long x) {
    if (x == 0) return 1;
    if (x % 2 == 1) return base * pow(base, x - 1) % MOD;
    Long y = pow(base, x / 2);
    return y * y % MOD;
}

int main() {
    int M, N; cin >> M >> N;
    cout << pow(M, N) << endl;
    return 0;
}