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
import sys
import itertools
# import numpy as np
import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

m, n = map(int, input().split())

MOD = 10 ** 9 + 7
def pow(a, b):
    c = 1
    while b > 1:
        if b % 2 == 0:
            b //= 2
            a *= a
        else:
            b -= 1
            c *= a
        a %= MOD
        c %= MOD
    return a * c
print(pow(m, n) % MOD)



