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
import std.stdio;
import std.math;
import std.conv;
import std.string;

void main()
{
    ulong n,m;
    string[] s = readln.chomp.split();
    m = s[0].to!ulong, n = s[1].to!ulong;
    
    ulong a = pow(m, n)%1000000007;
    
    writeln(a);   
}