#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long b){
  long long ans = 1;
  while (b > 0){
    if (b % 2 == 1){
      ans = ans * a % MOD;
    }
    a = a * a % MOD;
    b /= 2;
  }
  return ans;
}
int main(){
  long long m, n;
  cin >> m >> n;
  cout << modpow(m, n) << 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>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long b){
  long long ans = 1;
  while (b > 0){
    if (b % 2 == 1){
      ans = ans * a % MOD;
    }
    a = a * a % MOD;
    b /= 2;
  }
  return ans;
}
int main(){
  long long m, n;
  cin >> m >> n;
  cout << modpow(m, n) << endl;
}

```