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;
#define M 1000000007
typedef unsigned long long l;
l p(l x,l n){
	if(!n)return 1;
	l r=p(x*x%M,n/2);
	if(n%2)r=r*x%M;
	return r;
}
int main(){
	l a,b;cin>>a>>b;cout<<p(a,b)<<endl;
}