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 = 1000000007
m, n = map(int, raw_input().split())
mod = m
while 1:
    if n == 1: break
    if n % 2 == 0:
        mod = (mod * mod) % M 
    else:
        mod = ((mod * mod) % M * m) % M
    n /= 2
print mod