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;

public class Hello
{
    public const long E7 = 1000000007;
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var m = long.Parse(line[0]);
        var n = long.Parse(line[1]);
        var ret = power(m, n) % E7;
        Console.WriteLine(ret);
    }
    public static long power(long x, long n)
    {
        if (n == 0) return 1;
        if (n % 2 == 0) return power(x * x, n / 2) % E7;
        else return x * (power(x, n - 1) % E7);
    }
}

