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<string.h>
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;

const long M = 1000000007;

long power(long x, long n)
{
	long res;
	if (n == 0)
		return 1;
	long double a = fmodl((long  double)x, (long  double)M);
	a = fmodl((long  double)a*x, (long  double)M);
	res = power(long(a), n / 2);

	if ((n & 1) != 0)
	{
		double b = fmodl((long  double)x, (long  double)M);
		b = fmodl(res*b, (long  double)M);
		res = long(b);
	}
	return res;
}
int main(){
	std::istream & c_in = cin;

	long m,n;
	c_in >> m >> n;
	cout << power(m,n) << endl;
}
#endif