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())

def mod_binary(base, exponent, modulo):
  mask = 1 << (exponent.bit_length() - 1)
  ans = 1
  while mask:
    ans = ans * ans % modulo
    if exponent & mask:
      ans = ans * base % modulo
    mask >>= 1
  return ans

print(mod_binary(m, n, 1000000007))
