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

P = 10 ** 9 + 7

# 繰り返し二乗法
def pow(x, n, p):
  r = 1
  while n > 0:
    if n & 1:
      r = (r * x) % p
    x = (x * x) % p
    n >>= 1
  return r

print(pow(m, n, P))

