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
def cal_expo(m, n, MOD):
    if m == 1:
        return 1
    ans = 1
    while n != 1:
        if n % 2 != 0:
            ans = (ans * m) % MOD
        n //= 2
        m = (m ** 2) % MOD
    ans = (ans * m) % MOD
    return ans


def main():
    m, n = map(int, input().split())
    MOD = 10 ** 9 + 7
    ans = cal_expo(m, n, MOD)
    print(ans)


if __name__ == '__main__':
    main()

