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;
#define mod 1000000007
long long qq(long long x,long long y){
    if(y==0){
        return 1;
    }
    else if(y%2==0){
        return qq(x*x%mod,y/2);
    }
    else{
        return x*qq(x,y-1)%mod;
    }
}
int main(){
    long long m,n;
    cin>>m>>n;
    cout<<qq(m,n)<<endl;
    return 0;
}
