#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;

long long mod_pow(long long a,long long b)
{
long long ans=1;
while(b>0)
{
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}

int main()
{
long long m,n;scanf("%lld %lld",&m,&n);
printf("%lld\n",mod_pow(m,n));
}


### Prompt

Please formulate a Cpp solution 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>
#define mod 1000000007
using namespace std;

long long mod_pow(long long a,long long b)
{
long long ans=1;
while(b>0)
{
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}

int main()
{
long long m,n;scanf("%lld %lld",&m,&n);
printf("%lld\n",mod_pow(m,n));
}


```