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;
using System.Linq;

namespace NTL_1_B
{
    class Program
    {
        static ulong mod_pow(ulong x, ulong n)
        {
            if (n == 0) return 1;
            ulong res = mod_pow(x * x % 1000000007, n / 2);
            if (n % 2 == 1) res = res * x % 1000000007;
            return res;
        }
        static void Main(string[] args)
        {
            ulong[] x = Console.ReadLine().Split().Select(ulong.Parse).ToArray();
            Console.WriteLine(mod_pow(x[0], x[1]));
        }
    }
}