#include <bits/stdc++.h>
#define INF 114514810
#define FOR(i, r, n) for(int i=(r); i<(n); i++) 
#define REP(i, n) FOR(i, (0), n)

using namespace std;

long long int m, n, ans = 1;

int main(){
	cin >> m >> n;
	while (n > 0){
		if (n & 1) ans = ans*m % 1000000007;
		m = m*m % 1000000007;
		n >>= 1;
	}
	cout << ans << endl;
}
### Prompt

In Cpp, your task is to solve 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 INF 114514810
#define FOR(i, r, n) for(int i=(r); i<(n); i++) 
#define REP(i, n) FOR(i, (0), n)

using namespace std;

long long int m, n, ans = 1;

int main(){
	cin >> m >> n;
	while (n > 0){
		if (n & 1) ans = ans*m % 1000000007;
		m = m*m % 1000000007;
		n >>= 1;
	}
	cout << ans << endl;
}
```