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<iostream>
using namespace std;

long power_surp(long, long, long);

int main()
{
	int m;
	long n;
	long surp; //surplus
	long a=1000000007;

	cin>>m>>n;

	surp=power_surp(m,n,a);

	cout<<surp<<endl;
	return 0;
}

long power_surp(long x, long n, long a)
{
	long tmp=1;

	if(n>0) tmp=power_surp(x*x%a, n/2, a);
	if(n%2==1) tmp=tmp*x%a;

	return tmp;
}