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
kMod = 1000000007
m, n = map(int, input().split())

buf = {1:m}

i = 2

while i <= n:
    prev = buf[i // 2]
    cur = (prev * prev) % kMod
    buf[i] = cur
    i *= 2

ans = 1
i = 0
while (1 << i) <= n:
    if (1<<i) & n:
        ans *= buf[1<<i]
        ans %= kMod
    i += 1
print(ans)


