#include <iostream>
#define P 1000000007
using namespace std;
typedef long long ll;
int mod_power(ll,int);

int main(){
  int m,n;
  cin>>m>>n;
  cout<<mod_power((ll)m,n)<<endl;
  return 0;
}

int mod_power(ll x,int y){
  ll res=1;
  for(int i=0;i<=30;i++){
    if(y&(1<<i)) res=res*x%P;
    x=x*x%P;
  }
  return res%P;
}
### Prompt

Develop a solution in cpp to the problem described below:

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

### Response

```cpp
#include <iostream>
#define P 1000000007
using namespace std;
typedef long long ll;
int mod_power(ll,int);

int main(){
  int m,n;
  cin>>m>>n;
  cout<<mod_power((ll)m,n)<<endl;
  return 0;
}

int mod_power(ll x,int y){
  ll res=1;
  for(int i=0;i<=30;i++){
    if(y&(1<<i)) res=res*x%P;
    x=x*x%P;
  }
  return res%P;
}
```