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.

Constraints

* 1 ≤ m ≤ 100
* 1 ≤ n ≤ 109

Input


m n


Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Examples

Input

2 3


Output

8


Input

5 8


Output

390625
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong(), n = sc.nextLong();

        if(n == 0) {
            System.out.println(1);
        } else if(n % 2 == 0) {
            System.out.println((long)Math.pow(Math.pow(m, 2), n / 2) % 1000000007);
        } else {
            System.out.println((long)Math.pow(Math.pow(m, 2), n / 2) * m % 1000000007);
        }
    }
}