#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

LL power(LL x, LL n, LL m) {
  LL res = 1;
  if (n > 0) {
    res = power(x, n/2, m);
    if (n % 2 == 0) res = (res * res) % m;
    else res = (((res * res) % m) * x) % m;
  }
  return res;
}

int main() {
  int m, n;
  cin >> m >> n;

  cout << power(m, n, 1000000007) << endl;
}


### Prompt

Please create a solution in Cpp 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 <bits/stdc++.h>
using namespace std;
typedef long long LL;

LL power(LL x, LL n, LL m) {
  LL res = 1;
  if (n > 0) {
    res = power(x, n/2, m);
    if (n % 2 == 0) res = (res * res) % m;
    else res = (((res * res) % m) * x) % m;
  }
  return res;
}

int main() {
  int m, n;
  cin >> m >> n;

  cout << power(m, n, 1000000007) << endl;
}


```