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>

long long func(long long x,long long y){
	if(y == 0)return 1;
	else if(y % 2 == 0){
		return func(x*x%1000000007,y/2);
	}else{
		return x*func(x,y-1)%1000000007;
	}
}

int main(){
	int m,n;

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

	printf("%lld\n",func(m,n)%1000000007);
}