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 WARU 1000000007
typedef struct ull{
 long long num;
}ull;

int main(){
int m,n,i;
ull ans;
long long x;
ans.num=1;

scanf("%d %d",&m,&n);
x=m;

while(n>0){
 if((n & 1)==1){
   ans.num=(ans.num*x)%WARU;
   
 }
 
 x=(x*x)%WARU;
 n=n>>1;
}


