Maximum Sum Permutation

You are given an array $A$ of size $N$. The array will be used to perform $Q$ queries, where each query is comprised of a pair of integers, denoted by $L_i$ and $R_i$. Before the queries are executed, you are allowed to rearrange the elements in array $A$ as desired. Next, an integer variable $X$ is initialized to 0. For each of the $i$-th queries, calculate the sum of elements from $A_{L_i}$ th