<p>Given an integer array <code>nums</code> and two integers <code>lower</code> and <code>upper</code>, return <em>the number of range sums that lie in</em> <code>[lower, upper]</code> <em>inclusive</em>.</p>

<p>Range sum <code>S(i, j)</code> is defined as the sum of the elements in <code>nums</code> between indices <code>i</code> and <code>j</code> inclusive, where <code>i &lt;= j</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [-2,5,-1], lower = -2, upper = 2
<strong>Output:</strong> 3
<strong>Explanation:</strong> The three ranges are: [0,0], [2,2], and [0,2] and their respective sums are: -2, -1, 2.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [0], lower = 0, upper = 0
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-2<sup>31</sup> &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
	<li><code>-10<sup>5</sup> &lt;= lower &lt;= upper &lt;= 10<sup>5</sup></code></li>
	<li>The answer is <strong>guaranteed</strong> to fit in a <strong>32-bit</strong> integer.</li>
</ul>

class BinaryIndexedTree:
  def __init__(self, n):
    self.n = n
    self.c = [0] * (n + 1)

  def update(self, x, v):
    while x <= self.n:
      self.c[x] += v
      x += x & -x

  def query(self, x):
    s = 0
    while x > 0:
      s += self.c[x]
      x -= x & -x
    return s


class Solution:
  def countRangeSum(self, nums: List[int], lower: int, upper: int) -> int: 
    s = list(accumulate(nums, initial=0))
    arr = sorted(set(v for x in s for v in (x, x - lower, x - upper)))
    tree = BinaryIndexedTree(len(arr))
    ans = 0
    for x in s:
      l = bisect_left(arr, x - upper) + 1
      r = bisect_left(arr, x - lower) + 1
      ans += tree.query(r) - tree.query(l - 1)
      tree.update(bisect_left(arr, x) + 1, 1)
    return ans       
50043