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;
long long pow(long long a,long long b,long long q){
	long long res=1;
	while(b){
		if(b%2)res=res*a%q;
		b/=2;
		a=a*a%q;
	}return res;
}
int n,m,q=1e9+7;
int main(){
	cin>>n>>m;
	cout<<pow(n,m,q)<<endl;
	return 0;
}
