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(int argc, char **argv)
{
	char inputline[20];
	int base, exponent;
	long long int answer;
	
	
	fgets( inputline, sizeof( inputline ), stdin );
	sscanf( inputline, "%d%d", &base, &exponent );
	
	
	answer = base;
	while(exponent > 1){
		exponent = exponent - 1;
		answer *= base;
		answer = answer % 1000000007;
	}
	
	
	printf("%lld\n", answer);
	
	
	return 0;
	
}