Profitable Schemes

There is a group of n gang members and a list of various crimes they could commit. The ith crime requires group[i] gang members to participate and generates a profit of profit[i].

A scheme is any subset of crimes such that at most n gang members participate. Return the number of schemes which generate at least minProfit profit. Since the answer may be very large, return it modulo 10^9 + 7.

Examples
Input: [5,3,[2,2],[2,3]]
Output: 2
Hints

Profitable Schemes

There is a group of `n` gang members and a list of various crimes they could commit. The `i`th crime requires `group[i]` gang members to participate and generates a profit of `profit[i]`.