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>
#include<math.h>

long c;

int f(double m,double n){
double b = pow(m,n);
c = (int)b % 1000000007;
return c;
}

int main(void){
long m,n;
scanf("%d %d",&m,&n);
printf("%d\n",f(m,n));

return 0;

}
