You are given four integers minLength, maxLength, oneGroup, and zeroGroup.

A binary string is defined as good if:

• Its length is at least minLength and at most maxLength.

• The length of each contiguous block of '1's is a multiple of oneGroup.

• The length of each contiguous block of '0's is a multiple of zeroGroup.

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

Constraints:

• $1 \leq$ minLength $\leq$ maxLength $\leq 10^5$

• $1 \leq$ oneGroup, zeroGroup $\leq$ maxLength

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.