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<cstdio>
#include<math.h>
#define MOD 1000000007
using namespace std;
int pos(int m,int n)
{
	if(n==0) return 1;
	int x=pos(m,n/2);
	ans=x*x%MOD;
	if(n%2==1) ans=ans*m%MOD;
	return ans;
}
int main()
{
	int m,n,i,j;
	scanf("%d%d",&m,&n);
	printf("%d\n",pos(m,n));
	
}