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 <stdio.h>
#define M 1000000007
 
unsigned long long power(int m, int n) {
    unsigned long long x;
    if (n == 0) return 1;
    if (n % 2) {
        x = power(m, n-1);
        return (x * m) % M;
    }
    else {
        x = power(m, n/2);
        return (x * x) % M;
    }

 
int main() {
    int m, n, i;
    unsigned long long x;
 
    scanf("%d %d", &m, &n);
 
    printf("%llu\n", power(m, n));
 
    return 0;
}
