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;
const int MOD=1000000007;
typedef long long ll;
ll pow(ll m,ll n){
    ll res=1;
    while(n>0){
        if(n&1) res=res*m%MOD;
        m=m*m%MOD;
        n>>=1;
    }
    return res;
}
int main(){
    int m,n;
    cin>>m>>n;
    cout<<pow(m,n)<<endl;
    return 0;
}