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;

#define MOD (1000000000+7)

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

	long long ans = 1;
	while( n ) {
		if( n % 2 ) ans = ans * m % MOD;
		m = m * m % MOD;
		n /= 2;
	}

	cout << ans << endl;
}

