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
//By Vlgd
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll M=1000000007;
ll pow1(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%M;
		x=x*x%M;
		n>>=1;
	}
	return res;
} 
int main(){
	ll n,x;
	scanf("%lld%lld",&x,&n);
	printf("%lld\n",pow1(x,n));
}
