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 {

    static int mod = 1000000007;

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int m = Integer.parseInt(scan.next());
        int n = Integer.parseInt(scan.next());
        scan.close();

        System.out.println(modPow(m, n));
    }

    private static long modPow(long m, long n) {
        if (n == 0) {
            return 1;
        }

        if (n % 2 == 0) {
            return modPow(m * m % mod, n / 2);
        } else {
            return modPow(m * m % mod, (n - 1) / 2) * m % mod;
        }
    }

}

