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

namespace ConsoleApp8
{
	public static class Program
    {
        public static void Main(string[] args)
        {
			var data = Console.ReadLine ().Split(' ').Select( v => int.Parse(v)).ToArray();
			var result = Math.Pow(data[0],  data[1]) % 1000000007;
			Console.WriteLine (result);
			Console.ReadLine ();
		}
    }
}

