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)

#include<stdio.h>
int main(void)
{
    long m,n,i;
    long l=1;
	scanf("%ld %ld",&m,&n);
	for(i=0;i<n;i++){
	    l*=m;
	    l%=1000000007;
	}
	printf("%ld\n",l);
}