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
# -*- coding: utf-8 -*-
# 標準入力を取得
m, n = list(map(int, input().split()))

# 求解処理
def modpow(a: int, b: int, mod: int) -> int:
    ans = 1
    while b > 0:
        if (b & 1):
            ans = ans * a % mod
        a = a * a % mod
        b >>= 1
    return ans

ans = modpow(m, n, 1000000007)

# 結果出力
print(ans)
