#include <iostream>
using namespace std;

long long mod_pow(long long x, long long n, long long mod)
{
    long long res = 1;
    while(n>0)
    {
        if(n&1)   res = res * x % mod;
        x = x*x%mod;
        n >>= 1;
    }
    return res;
}
int main()
{
    long long m, n;
    cin >> m >> n;
    cout << mod_pow(m,n,1000000007) << 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 <iostream>
using namespace std;

long long mod_pow(long long x, long long n, long long mod)
{
    long long res = 1;
    while(n>0)
    {
        if(n&1)   res = res * x % mod;
        x = x*x%mod;
        n >>= 1;
    }
    return res;
}
int main()
{
    long long m, n;
    cin >> m >> n;
    cout << mod_pow(m,n,1000000007) << endl;
    return 0;
}
```