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>
#define ll long long
using namespace std;
int pow(ll x,ll y){
    if(y==0) return 1;
    return y%2==1?x*pow(x,y-1)%1000000007:pow(x*x%1000000007,y/2);
}
int main(){
    ll m,n; cin>>m>>n;
    cout<<pow(m,n)<<endl;
    return 0;
}
