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

ll po(ll a, ll b){
	ll ans=1;
	a=a%M;
	while(b>0){
		if(b%2) ans=ans*a%M;
		a=a*a%M;
		b/=2;
	}
	return ans;
}

int main() {
	ll a,b;
	cin>>a>>b;
	cout<<po(a,b)<<endl;
	return 0;
}
