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 JAVA (judge verdict: Accepted)

import java.util.*;
import java.lang.*;
import java.io.*;
 
class Main {
    public static long modpow(long a, long b, long m) {
        long ret = 1;
        while(b > 0) {
            if((b & 1) == 1) ret = ret * a % m;
            a = a * a % m;
            b >>= 1;
        }
        return ret;
    }
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt(), b = sc.nextInt();
        System.out.println(modpow(a, b, 1000000007));
    }
}