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
#include<iostream>
using namespace std;
#inlcude<cstdio>

int main()
{
    long long m, n;
    scanf("%d %d", &m, &n);
    
    long long x = m, y = n, z = 1;
    for( ; y; y >>= 1){
        if(y & 1){ z = (z * x) % 1000000007; }
        x = x * x;
    }
    printf("%d\n", z);

    return 0;
}