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
function power(x, n, M){
   var  tmp = 1;
   if ( n >= 1){
      tmp = power(x, n/2, M);
      if ( n%2 == 0 )tmp = (tmp*tmp)%M;
      else tmp = (((tmp*tmp)%M)*x)%M;
   }
   return tmp;
}
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var arr=input.trim().split(" ").map(Number);
console.log(power(arr[0], arr[1], 1000000007));