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: Time Limit Exceeded)

using System;

namespace Ex160424_1{
    public class Program{
        public static void Main(string[] args){
            const int mod = 1000000007;
            var input = Console.ReadLine().Split(' ');
            var m = long.Parse(input[0]);
            var n = long.Parse(input[1]);
            var result = 1L;

            for(var i = 0; i < n; i++){
                result = result * m % mod;
            }
            Console.WriteLine(result);
        }
    }
}