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<stdio.h>
#include<vector>
#include<math.h>
#include<algorithm>

using namespace std;

int main()
{
	long long int m, n;
	long long int mod = 1000000007;
	cin >> m >> n;
	long long int power = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			power = power * m % mod;
		}
		m = m * m % mod;
		n = n >> 1;
	}

	cout << power << endl;
	return 0;
}