Maximize

Given an array with $N$ elements and you have to answer $Q$ queries of the form $L$ $R$ $A$ where $A$ is one of the two equal sides of an isosceles triangle. For each query you have to print $Arr[i]$ such that $ $L$ \leq i \leq $R$ $ which will give maximum area of isosceles triangle with sides $A$, $A$, $Arr[i]$. If there is no such side print "-1" without quotes. Note : Area of triangle