#include <iostream>

using namespace std;

#define MOD 1000000007
typedef long long ll;

ll mod_pow(ll x, ll n, ll mod)
{
    if (n == 0) {
        return 1;
    }
    ll res = mod_pow(x * x % mod, n/2, mod);
    if (n & 1) res = res * x % mod;
    return res;
}

int main()
{
    ll m, n;
    cin >> m >> n;
    cout << mod_pow(m, n, MOD) << endl;
    return 0;
}
### 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 <iostream>

using namespace std;

#define MOD 1000000007
typedef long long ll;

ll mod_pow(ll x, ll n, ll mod)
{
    if (n == 0) {
        return 1;
    }
    ll res = mod_pow(x * x % mod, n/2, mod);
    if (n & 1) res = res * x % mod;
    return res;
}

int main()
{
    ll m, n;
    cin >> m >> n;
    cout << mod_pow(m, n, MOD) << endl;
    return 0;
}
```