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, raw_input().split())
MOD = 1000000007
lst = [m]
i = 0
while True:
  lst.append(lst[i]*lst[i]%MOD)
  i += 1
  if i > 30:
    break

ans = 1
i = 0
while True:
  if n % 2 == 1:
    ans = ans * lst[i] % MOD
    n -= 1
  i += 1
  n /= 2
  if n == 0:
    break

print ans