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

MOD = 1000000007

def pow_mod(m, n):
    if n == 1:
        return m % MOD
    else:
        tmp = pow_mod(m, n / 2)
        if n % 2 == 0:
            return tmp * tmp % MOD
        else:
            return tmp * tmp * m % MOD
    
if __name__ == '__main__':
    line = sys.stdin.readline()
    m, n = line.split()
    m, n = int(m), int(n)
    
    sys.stdout.write(str(pow_mod(m, n)) + '\n')
        