#include <iostream>

using namespace std;

#define MOD 1000000007LL

long long power(int a, int b)
{
	if(b == 0) { return 1LL; }
	
	if(b % 2 == 1) { return power(a, b / 2) * power(a, b / 2) % MOD * a % MOD; }
	
	return power(a, b / 2) * power(a, b / 2) % MOD;
}

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

Generate 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 <iostream>

using namespace std;

#define MOD 1000000007LL

long long power(int a, int b)
{
	if(b == 0) { return 1LL; }
	
	if(b % 2 == 1) { return power(a, b / 2) * power(a, b / 2) % MOD * a % MOD; }
	
	return power(a, b / 2) * power(a, b / 2) % MOD;
}

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