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<cstdio>  
using namespace std;
typedef long long LL;

LL mod_pow(LL n, LL m, LL mod) {
	LL res = 1;
	while (m > 0) {
		if (m & 1)
			res = res * n % mod;
		n = n * n % mod;
		m >>= 1;
	}
	return res;
}
int main()
{
	LL n, m;
	LL mod = 1000000007;
	scanf("%lld %lld", &n, &m);
	printf("%d\n", mod_pow(n, m , mod));
	return 0;
}
