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>

const long long mod=1000000007LL;

long long powmod(long long m,long long n){
	long long res=1;
	while(n>0){
		if(n&1)(res*=m)%=mod;
		n>>=1;
		(m*=m)%=mod;
	}
	return res;
}

int main()
{
    long long m,n;
    cin>>m>>n;
    cout<<powmod(m,n)<<endl;
}