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;

typedef unsigned long long ull;
ull mod = ull(1e9 + 7);

ull power(ull m, ull n)
{
	ull pow = 1;
	while (n != 0) {
		m %= mod;
		if (n % 2 == 1) {
			pow *= m;
			pow %= mod;
		}
		m *= m;
		n >>= 1;
	}
	return pow;
}

int main()
{
	ull m, n;
	cin >> m >> n;
	cout << power(m, n) << endl;
	return 0;
}