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;

#define DIV 1000000007LL

u_long mod(u_long m, u_long n)
{
	u_long res = 1;

	while (n > 0) {
		if (n & 1) {
			res *= m;
			res %= DIV;
		}
		n >>= 1;
		m *= m;
		m %= DIV;
	}

	return res;
}

int main(void)
{
    u_long m, n;
	cin >> m >> n;
	cout << mod(m, n) << endl;
    return 0;
}