Triplets Min

You are given an integer array $A$ of size $N$. A *triplet array* is defined as the collection of $\min(A_i,A_j,A_k)$ for all triplets $(i,j,k)$, where $1\le i\lt j\lt k\le N$. You are given $Q$ queries of the following type: - Given an integer $K$, return the value of $K^{th}$ **smallest** element in the *triplet array*. ### Input - The first line of input will contain a single integer $T$, d