#include <bits/stdc++.h>
#define MOD 1000000007
using namespace std;

int power(int m, int n) {
	long long res = 1, mm = m;
	while (n) {
		if (n & 1) res = (res * mm) % MOD;
		mm = (mm * mm) % MOD;
		n >>= 1;
	}
	return (int)res;
}

int main()
{
	int m, n;
	cin >> m >> n;
	cout << power(m, n) << endl;
	return 0;
}
### Prompt

Please formulate a Cpp solution to the following problem:

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 <bits/stdc++.h>
#define MOD 1000000007
using namespace std;

int power(int m, int n) {
	long long res = 1, mm = m;
	while (n) {
		if (n & 1) res = (res * mm) % MOD;
		mm = (mm * mm) % MOD;
		n >>= 1;
	}
	return (int)res;
}

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