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 int MD = 1000000007;
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var m = int.Parse(line[0]);
        var n = int.Parse(line[1]);
        var ret = power(m, n);
    }
    public static long power(int m, int n)
    {
        var w = (int)(Math.Log10(n) / Math.Log10(2)) + 1;
        var a = new long[w];
        a[0] = m;
        for (int i = 1; i < w; i++)
            a[i] = (a[i - 1] * a[i - 1]) % MD;
        var ret = 1L;
        for (int i = 0; i < w; i++)
            if (((n >> i) & 1) == 1) { ret *= a[i]; ret %= MD; }
        return ret;
    }
}

