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>
long long MOD = 1e9 + 7;
long long repeatedpow(long long x, long long y){
    if(y == 0) return 1;
    if(y % 2 == 0) return repeatedpow(x, y / 2)*repeatedpow(x, y / 2) % MOD;
    else return x*repeatedpow(x, y -1) %MOD;
}
int main(){
    long long m, n;
    std::cin >> m >> n;
    std::cout << repeatedpow(m, n) << std::endl;
}
