There is a group of n members, and a list of crimes that can be committed. For each crime at index i, group[i] members are required to participate, and it generates a profit of profit[i].

A scheme is a subset of crimes. A scheme is valid and profitable if the total number of members required does not exceed n, and the total profit generated is at least minProfit.

Return the total number of profitable schemes. Since the answer may be large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ n $\leq 100$

• $0 \leq$ minProfit $\leq 100$

• $1 \leq$ group.length $\leq 100$

• $1 \leq$ group[i] $\leq 100$

• profit.length $==$ group.length

• $0 \leq$ profit[i] $\leq 100$

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.