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 <cmath>
#define M 1000000007
using namespace std;
typedef unsigned long long ull;


ull power(ull x, ull n){
	if(n==0)
		return 1;
	ull temp = power(x*x%M, n/2)%M;
	if(n%2==0){
		return temp;
	}else{
		return x*temp;	
	}
}

int main() {
	ull m,n;
	cin >> m;
	cin >> n;
	cout << power(m,n)%M << endl;
	return 0;
}