#include <stdio.h>

#define MOD 1000000007

int rec(int m, int n) {
    if (n == 0) return 1;
    long long t = rec(m, n/2);
    if (n % 2 == 0) return (t * t) % MOD;
    else return (((t * t) % MOD) * m) % MOD;
}

int main()
{
    int n, m;
    scanf("%d %d", &m, &n);
    printf("%d\n", rec(m, n));
    return 0;
}


### Prompt

Please provide a Cpp coded solution to the problem described below:

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 <stdio.h>

#define MOD 1000000007

int rec(int m, int n) {
    if (n == 0) return 1;
    long long t = rec(m, n/2);
    if (n % 2 == 0) return (t * t) % MOD;
    else return (((t * t) % MOD) * m) % MOD;
}

int main()
{
    int n, m;
    scanf("%d %d", &m, &n);
    printf("%d\n", rec(m, n));
    return 0;
}


```