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 <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
const int mod=1000000007;
int main(){
	long long n,m;
	scanf("%lld%lld",&n,&m);
	long long ans=1;
	while(m){
		if(m&1) ans=(n*ans)%mod;
		n=(n*n)%mod;
		m>>=1;
	}
	cout<<ans<<endl;
	return 0;
}

