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<cmath>
#define M 1000000007
using namespace std;

long long int pos(unsigned long long int x, unsigned long long int n)
{
	unsigned long long int res=1;
	while(n>0)
	{
		if(n&1)res=res*x%M;
		x=x*x%M;
		n>>=1;
	}
	return res;
}

int main()
{
	unsigned long long int m, n;
	cin >> m >> n;
	cout << pos(m, n) << endl;
	return 0;
}
