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 C# (judge verdict: Accepted)

using System;

namespace AOJ
{
    class ElementaryNumberTheory
    {
        private static decimal PowMod(decimal m, decimal n)
        {
            if (n == 0) { return 1; }

            decimal res = PowMod(m * m % 1000000007, Math.Floor(n / 2));
            if (n % 2 == 1) { res = res * m % 1000000007; }
            return res;
        }

        public static void Main()
        {
            var input = Console.ReadLine().Split(' ');
            int a = int.Parse(input[0]);
            int b = int.Parse(input[1]);
            Console.WriteLine(PowMod(a, b));
        }
    }
}