Rank Queries

Chef has an array $A$ of $N$ integers. The *rank* of an index $i$ is defined as $(L + 1)$, where $L$ is the number of indices $j$ in the array such that $A_j \gt A_i$. Note that multiple indices may have the same rank. Chef needs to answer $Q$ queries of the following type: - $K$ $R$: Given integers $K$ and $R$ $(1 \leq K, R \leq N)$, the task is to determine the **smallest** integer $X$ such