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 <cstdlib>
using namespace std;
typedef long long int64;
inline int binary_power(int64 x,int64 n,int64 mod){
	int res=1;
	while (n){
		if (n&1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}
int main(){
	int64 m,n;
	cin >> m >> n;
	cout << binary_power(m,n,1000000007) << endl;
	return 0;
}