#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;

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

### Prompt

Construct a CPP code solution to the problem outlined:

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 rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;

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

```