Given the array nums consisting of n positive integers. You computed the sum of all non-empty continous subarrays from the array and then sort them in non-decreasing order, creating a new array of n * (n + 1) / 2 numbers.
Return the sum of the numbers from index left to index right (indexed from 1), inclusive, in the new array. Since the answer can be a huge number return it modulo 10^9 + 7.
 
Example 1:
Input: nums = [1,2,3,4], n = 4, left = 1, right = 5
Output: 13 
Explanation: All subarray sums are 1, 3, 6, 10, 2, 5, 9, 3, 7, 4. After sorting them in non-decreasing order we have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 1 to ri = 5 is 1 + 2 + 3 + 3 + 4 = 13. 

Example 2:
Input: nums = [1,2,3,4], n = 4, left = 3, right = 4
Output: 6
Explanation: The given array is the same as example 1. We have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 3 to ri = 4 is 3 + 3 = 6.

Example 3:
Input: nums = [1,2,3,4], n = 4, left = 1, right = 10
Output: 50

 
Constraints:

1 <= nums.length <= 10^3
nums.length == n
1 <= nums[i] <= 100
1 <= left <= right <= n * (n + 1) / 2

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "#import heapq\nclass Solution:\n    def rangeSum(self, nums: List[int], n: int, left: int, right: int) -> int:\n        '''\n        if not nums: return 0\n        \n        module = 10**9+7\n        \n        n = len(nums)\n        heap = [[nums[i], i] for i in range(n)]\n        heapq.heapify(heap)\n        \n        count = 0\n        ans = 0\n    \n        while heap:    \n            [val, idx] = heapq.heappop(heap)\n            count += 1\n            if count > right:\n                break\n            if count >= left:\n           \n                ans += val % module\n            \n            if idx+1 < n:\n                heapq.heappush(heap, [val+nums[idx+1], idx+1])\n        \n        return ans % module\n            \n        '''\n        \n        def subArraySum1(target):\n            # return the number of subarrays whose sums less than or equal to target\n            \n            count = 0\n            left, right = 0, 0        \n            running_sum = 0\n            \n            while right < n:\n                running_sum += nums[right]\n   \n                while left <= right and running_sum > target:\n\n                    running_sum -= nums[left]\n                    left += 1\n                    \n                count += right-left+1\n                \n                right += 1\n            \n            return count\n        \n        def subArraySum2(target):\n            # return the number of subarrays whose sums less than or equal to target\n            \n            count = 0\n            left, right = 0, 0\n            running_sum = 0\n            sub_sum     = 0\n            overall_sum = 0          \n            \n            while right < n:\n                running_sum += nums[right]\n                sub_sum += nums[right]*(right-left+1)\n                while left <= right and running_sum > target:\n                    sub_sum -= running_sum\n                    running_sum -= nums[left]\n                    left += 1\n                    \n                count += right-left+1\n                \n                overall_sum += sub_sum\n                \n                right += 1\n            \n            return count, overall_sum\n        \n        def findSum(target):\n            # return the sum of first target-th element of non-decreasing ordered subarray sum\n            if target == 0:\n                return 0\n            \n            # Binary search\n            l, r = min(nums)-1, sum(nums)+1\n\n            while l+1 < r:\n                m = l + (r-l)//2\n\n                count = subArraySum1(m)\n                \n                if count < target:\n                    l = m\n                else:\n                    r = m\n                    \n            count, summ = subArraySum2(r)\n    \n            return summ%(10**9+7) - (r%(10**9+7))*(count-target)\n            \n    \n        return (findSum(right) - findSum(left-1))%(10**9+7)\n                    \n                    \n                    \n            \n            \n            \n        \n            \n            \n        \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'rangeSum'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6814