You are given an integer array nums and three integers m, l, and r.

Select at least $1$ and at most m pairwise disjoint subarrays from nums such that the length of each chosen subarray is between l and r, inclusive.

Return the maximum possible total sum of the elements in the chosen subarrays.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 1000$

• $-10^9 \leq$ nums[i] $\leq 10^9$

• $1 \leq$ m $\leq$ n

• $1 \leq$ l $\leq$ r $\leq$ 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.