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
#define MOD 1000000007

#include <iostream>

typedef long long int ll;

using namespace std;

ll n,m;
int main(void)
{
	cin >> m >> n;
	ll res = 1;
	ll cur = m;
	ll pw = 1;
	while(n != 0)
	{
		if(n % (pw * 2) != 0)
		{
			res = (res * cur) % MOD;
			n = n - pw;
		}
		pw = pw * 2;
		cur = (cur * cur) % MOD;
	}
	cout << res << endl;
}