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
using System;

namespace AOJ
{
    class ElementaryNumberTheory
    {
        private static decimal Pow(decimal m, decimal n)
        {
            if (n == 0) { return 1; }

            decimal res = Pow(m * m, Math.Floor(n / 2));
            if (n % 2 == 1) { res = res * m; }
            return res;
        }

        public static void Main()
        {
            var input = Console.ReadLine().Split(' ');
            int a = int.Parse(input[0]);
            int b = int.Parse(input[1]);
            Console.WriteLine(Pow(a, b) % 1000000007);
        }
    }
}