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 <cstdio>
#define MOD 1000000007
using namespace std;
long long pow(long long x, long long n) {
	if (n == 0) return 1;
	if (n % 2 == 0) return pow(x * x % MOD, n / 2);
	return pow(x * x % MOD, n / 2) * x % MOD;
}
int main()
{
	long long x, n;
	scanf("%lld%lld", &x, &n);
	printf("%lld\n", pow(x, n));
	return 0;
}
