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 ll;
const ll mod = 1000000007LL;

template<typename T>
T pow(T x, T e){
    T res = 1;
    for(; e>0; e>>=1, (x*=x)%=mod)if(e & 1)(res *= x) %= mod;
    return res;
}

int main(){
    ll n, m;
    cin >> m >> n;
    cout << pow(m, n) << '\n';
    return 0;
}