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
m=input().split()
mod=1000000007
m[0] = int(m[0])
m[1]=int(m[1])
i=1

for x in range(0, m[1]):
	i *= m[0]
	i %= mod

print(i)