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 C_punipuni
{
    class Program
    {
        static void Main(string[] args)
        {
            string a = Console.ReadLine();
            int b = a.IndexOf(" ");
            int m = int.Parse(a.Remove(b));
            a = a.Remove(0,b);
            int n = int.Parse(a);
            double A = Math.Pow(m,n);
            Console.WriteLine(A % 1000000007);
        }
    }
}