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>
using namespace std;

long long modpow(long long m, long long n, long long mod){
    long long res = 1;
    while (n > 0)
    {
        if(n & 1) res = res * m % mod;
        m = m * m % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    long long m, n;
    cin >> m >> n;
    cout << modpow(m, n, 1000000007) << endl;
}
