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(long a, long b, long mod) {
	if (b == 0) return 1;
	long res = power(a, b / 2, mod);
	if (b % 2) res = res * res % mod * a % mod;
	else res = res * res % mod;
	return res;
}

int main() {
	long m, n;
	cin >> m >> n;
	cout << power(m, n, 1000000007) << endl;
}
