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: Wrong Answer)

using System;
using System.Linq;  
class A{
static void Main(){
long []a=Console.ReadLine().Split().Select(long.Parse).ToArray();
if(a[0]==0){Console.WriteLine(1);}
else if(a[1]%2==0){Console.WriteLine(Math.Pow(a[0]*a[0],a[1]/2));}
else{Console.WriteLine(Math.Pow(a[0]*a[0],a[1]/2)*a[0]);}
}

}