#include <iostream>

using namespace std;
using llong = long long;
constexpr llong p = 1000000007;

llong power_mod(llong m,llong n){
  llong pm = 1;
  llong mult=m;
  while(n!=0){
    if(n&1)
      pm = (pm*mult)%p;
    n >>= 1;
    mult = (mult*mult)%p;
  }
  return pm;
}

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

Please provide a CPP coded solution to the problem described below:

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;
using llong = long long;
constexpr llong p = 1000000007;

llong power_mod(llong m,llong n){
  llong pm = 1;
  llong mult=m;
  while(n!=0){
    if(n&1)
      pm = (pm*mult)%p;
    n >>= 1;
    mult = (mult*mult)%p;
  }
  return pm;
}

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