#include<iostream>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
ll pow_mod(ll m,ll n, ll mod){
	ll res=1;
	while(n>0){
		if(n&1)res=res*m%mod;
		m=m*m%mod;
		n >>=1 ;
	}
	return res;
}
int main(){
	ll n,m;
	cin>>m>>n;
	cout<<pow_mod(m,n,MOD)<<endl;
	return 0;
}

### Prompt

Please provide a CPP coded solution 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>
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
ll pow_mod(ll m,ll n, ll mod){
	ll res=1;
	while(n>0){
		if(n&1)res=res*m%mod;
		m=m*m%mod;
		n >>=1 ;
	}
	return res;
}
int main(){
	ll n,m;
	cin>>m>>n;
	cout<<pow_mod(m,n,MOD)<<endl;
	return 0;
}

```