Problem:
Power

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.

Input

m n

Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Constraints

1 ≤ m ≤ 100

1 ≤ n ≤ 109

Sample Input 1

2 3

Sample Output 1

8

Sample Input 2

5 8

Sample Output 2

390625

Solution in Haskell (judge verdict: Memory Limit Exceeded)

main = do
    [m,n] <- fmap (map read.words) getLine
    print $ calcMod m n 

calcMod m n = (recPow m n) `mod` 1000000007

recPow :: Integer -> Integer -> Integer
recPow m n
  | n == 0 = 1
  | even n = recPow (m^2) (n `div` 2)
  | otherwise = m * recPow (m^2) (n `div` 2)