You are given an array A. A triplet is said to be a Harmonic triplet if it satisfies the following conditions :
You have to find the harmonic triplet with the maximum value of A[i]×A[j]×A[k].
You are given q queries, where in each query you are given jth index and you have to find the harmonic triplet with value at jth index which has maximum product.
Note
If there are no elements to the left or right of j which satisfy the given conditions, answer for the given index will be 0.
Input format
Output format
Constraints
Note
Use fast I/O techniques.