#include <iostream>
typedef long long ll;
using namespace std;
ll modpow(ll x, ll e, ll n) {
  ll res = 1;
  while (e > 0) {
    if (e % 2 == 1) {
      res = res * x % n;
    }
    e /= 2;
    x = x * x % n;
  }
  return res;
}
int main() {
  ll m, n;
  cin >> m >> n;
  cout << modpow(m, n, 1000000007) << endl;
  return 0;
}
### Prompt

Your task is to create 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>
typedef long long ll;
using namespace std;
ll modpow(ll x, ll e, ll n) {
  ll res = 1;
  while (e > 0) {
    if (e % 2 == 1) {
      res = res * x % n;
    }
    e /= 2;
    x = x * x % n;
  }
  return res;
}
int main() {
  ll m, n;
  cin >> m >> n;
  cout << modpow(m, n, 1000000007) << endl;
  return 0;
}
```