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;

int main()
{
	int m,n;
	cin >> m >> n;

	const int mod=1000000007;
	int64_t pow=1;
	int64_t c=m;
	int mask=1;
	while (mask<=n)
	{
		if ((n&mask)!=0)
		{
			pow*=c;
			pow%=mod;
		}
		c*=c;
		c%=mod;
		mask<<=1;
	}
	cout << pow << endl;
}






