#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll ppp(ll x, ll k){
    ll res = 1;
    if(k == 0) return 1;
    res = ppp(x * x % mod, k/2);
    if(k & 1) res = res * x % mod;
    return res;
}
int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    cout<<ppp(n, m)<<endl;
    return 0;
}

### 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>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll ppp(ll x, ll k){
    ll res = 1;
    if(k == 0) return 1;
    res = ppp(x * x % mod, k/2);
    if(k & 1) res = res * x % mod;
    return res;
}
int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    cout<<ppp(n, m)<<endl;
    return 0;
}

```