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>
#include<cmath>
typedef long long llong;
using namespace std;
const int mod = 1000000007;
llong pow(llong x, llong n)
{
	if (n == 0)
		return 1;
	else if (n % 2 == 0)
		return pow(x*x%mod, n / 2);
	else
		return pow(x*x%mod, n / 2)*x%mod;

}
int main()
{
	llong x, n;
	cin >> x >> n;
	cout << pow(x,n) << endl;
}
