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 Sample
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] str = Console.ReadLine().Split(' ');
            int m = int.Parse(str[0]);
            int n = int.Parse(str[1]);
            int divide = 1000000007;
            string binary = Convert.ToString(n,2);
            int sum = 1;
            for(int i = 0; i < binary.Length; i++)
            {
                sum = sum * sum % divide;
                if (binary[i] == '1') sum = sum * m % divide;
            }
            Console.WriteLine(sum);
        }
    }
}