You are given an array of integers nums and an array requests where requests[i] $= [\text{start}_i, \text{end}_i]$.

The $i^{\text{th}}$ request calculates the sum of all elements from index $\text{start}_i$ to index $\text{end}_i$, inclusive, in nums.

Return the maximum possible total sum of all requests obtained by permuting nums in any order. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ requests.length $\leq 10^5$

• requests[i].length $== 2$

• $0 \leq \text{start}_i \leq \text{end}_i <$ n

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.