Given integers low, high, zero, and one, you can construct a string starting from an empty string by repeatedly applying one of the following operations:

• Append the character '0' written zero times.

• Append the character '1' written one times.

A string is considered good if its length is between low and high inclusive.

Return the total number of different good strings that can be formed. Since the answer can be large, return it modulo $10^9 + 7$.

Constraints:

• $1 \le$ low $\le$ high $\le 10^5$

• $1 \le$ zero, one $\le$ low

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.