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<bits/stdc++.h>
using namespace std;
const long long int Mod=1e9+7;
int main(){
	long long int a  ,b ,c ,n ,i ,j ,m ,res=1;
	cin>>m>>n;
//	cout<<"\n";
	while(n){
		if(n%2){
			res=(res*m)%Mod;
		}
		m=(m*m)%Mod;
		n/=2;
	}
	cout<<res;
	cout<<"\n";
}
