Given an array of non negative integers nums and two integers l and r, compute the number of sub multisets of nums whose sum of elements falls within the range $[$l, r$]$ inclusive.

Since the result may be very large, return it modulo $10^9 + 7$.

Note: A sub multiset is an unordered collection of elements from nums where the frequency of each element does not exceed its frequency in nums. The sum of an empty sub multiset is $0$.

Constraints:

• $1 \leq$ nums.length $\leq 2 imes 10^4$

• $0 \leq$ nums[i] $\leq 2 imes 10^4$

• The sum of all elements in nums does not exceed $2 imes 10^4$

• $0 \leq$ l $\leq$ r $\leq 2 imes 10^4$

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.