You are given two numeric strings num1 and num2, and two integers min_sum and max_sum.

Return the number of integers $x$ such that num1 $\leq x \leq$ num2, and the sum of the digits of $x$ satisfies min_sum $\leq ext{digit\\_sum}(x) \leq$ max_sum. Since the answer may be large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ num1 $\leq$ num2 $\leq 10^{22}$

• $1 \leq$ min_sum $\leq$ max_sum $\leq 400$

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.