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;

typedef long long ll;
const int mod=1e9+7;
int main(){
    ll m,n;
    cin>>m>>n;

    ll ans=1;

    for(int i=0;i<40;i++){
        if((n>>i)&1)ans=ans*m%mod;
        m=m*m%mod;
    }
    cout<<ans<<endl;
    return 0;
}