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
def power(x, y, p):
	res = 1
	x = x % p
	while y > 0:
		if (y & 1) == 1 :
			res = (res * x) % p
		y = y >> 1
		x = (x * x) % p
	return res

data = [int(x) for x in input().split()]
print(power(data[0], data[1], 1000000007))
