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<stdio.h>

long long int power(long long int x, long long n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0)tmp = (tmp * tmp) % M;
		else tmp = (((tmp * tmp) % M)*x) % M;
	}
	return tmp;
}

int main(void)
{
	long long int m, n;
	int i;
	scanf_s("%lld %lld", &m, &n);

	
	printf("%lld\n",(m,n,1000000007));
	return 0;
}