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;
class A{
static void Main(){
long []a=Console.ReadLine().Split().Select(int.Parse).ToArray();
if(a[0]==0){Console.WriteLine(1);}
else if(a[1]%2==0){Console.WriteLine(Math.Pow(a[0]*a[0],a[1]/2));}
else{Console.WriteLine(Math.Pow(a[0]*a[0],a[1]/2)*a[0]);}
}

}