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())
a = 1000000007

def keisan(x, y):
    if y == 1:
        return x % a
    elif y % 2 == 0:
        return keisan(x, y/2)**2 % a
    else:
        return keisan(x, int(y/2))**2 * x % a

if n < 5:
    print(m**n)
else:
    ans = keisan(m, n)
    print(ans)
