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,bisect,math
sys.setrecursionlimit(15000)

M,N = map(int,sys.stdin.readline().split())

def powmod(m,n,mod):
  if n == 1:
    return m
  ret = (powmod(m*m%mod,n//2,mod))%mod
  if n%2==1:
    return (ret*m)%mod
  return ret%mod

print(powmod(M,N,1000000007))
