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>

#define BN (1000000007)

using namespace std;

long long mypower(long long m,long long n){
	if(n==0){
		return 1;
	}else{
		long long powered=mypower((m*m)%BN,n/2);
		if(n%2==0){
			return powered;
		}else{
			return (powered*m)%BN;
		}
	}
}

int main(){
	long long m,n;
	cin >> m >> n;
	
	cout << mypower(m,n) << endl;
	
	return 0;
}	
