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<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL mod=1e9+7;
LL bm(LL b,LL p,LL m){
	LL a=1;
	while(p){
		if(p&1)a=(a*b)%m;
		b=(b*b)%m;
		p>>=1;
	}
	return a;
}

int main(){
	int m,n;cin>>m>>n;
	cout<<bm(m,n,mod)<<endl;
}