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
//Power
#include <iostream>

using namespace std;

long long  power(long long m, long long n, long long M) {
    if(n == 0) return 1;
    if(n == 1) return m;
    return ((power(m * m % M, n / 2, M) * power(m, n % 2, M))) % M;
}

int main() {
    long long m, n;
    const long long M = 1000000007;
    cin >> m >> n;
    cout << power(m, n, M) << endl;
}
