#include<iostream>
using namespace std;

const long long mod = 1000000007;

long long mod_pow(long long x, long long n) {
	if (n == 0) return 1;
	long long res = mod_pow(x * x % mod, n / 2);
	if (n % 2) res = res * x % mod;
	return res;
}

int main() {
	long long m, n;
	cin >> m >> n;
	cout << mod_pow(m, n) % mod << endl;
}

### Prompt

Create a solution in cpp for 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<iostream>
using namespace std;

const long long mod = 1000000007;

long long mod_pow(long long x, long long n) {
	if (n == 0) return 1;
	long long res = mod_pow(x * x % mod, n / 2);
	if (n % 2) res = res * x % mod;
	return res;
}

int main() {
	long long m, n;
	cin >> m >> n;
	cout << mod_pow(m, n) % mod << endl;
}

```