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 A = 1000000007;

long power(long m,long n){
	if(n == 1) return m;
	if(n%2 != 0) return ((power(m%A*m%A,n/2))%A*m%A);
	return ((power(m%A*m%A,n/2))%A);
}
	
int main() {
	long m,n;
	cin >> m >> n;
	cout << power(m,n) << endl; 
	return 0;
}
