#include<iostream>
#include<vector>

using namespace std;
using ll = long long;
ll pow(ll n, ll m);
int main() {
	ll n, m;
	cin >> n >> m;
	ll k;
	k=pow( n,  m);
	cout << k << endl;
	
	
}
ll pow(ll n, ll m) {
	ll res = 1;
	int z = 1000000007;
	while (m > 0) {
		if (m & 1) {
			res *= n;
			res = res%z;
		}
		n = n*n;
		n = n%z;
		m >>= 1;
	}
	return res;
}


### 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>
#include<vector>

using namespace std;
using ll = long long;
ll pow(ll n, ll m);
int main() {
	ll n, m;
	cin >> n >> m;
	ll k;
	k=pow( n,  m);
	cout << k << endl;
	
	
}
ll pow(ll n, ll m) {
	ll res = 1;
	int z = 1000000007;
	while (m > 0) {
		if (m & 1) {
			res *= n;
			res = res%z;
		}
		n = n*n;
		n = n%z;
		m >>= 1;
	}
	return res;
}


```