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 long int mod_pow(long long int x , int n , int mod){
	long long int ret=1;
	while(n>0){
		if(!(n%2==0)) ret=ret*x % mod;
		x = x * x % mod;
		n>>=1;
	}
	return ret;
}

int main(){
	const int mod=1000000007;
	int m , n;
	cin >> m >> n;
	cout << mod_pow(m , n , mod) << endl;
	return 0; 
}