City of Happy People Problem Statement

Imagine a city where the happiness of each resident is described by a numerical value. Ninja, who is visiting this city, is interested in forming groups of people such that the total happiness of the group falls within a specified range. Your task is to determine how many ways Ninja can form such groups.

Example:

Input:

HAPPINESS = [-1, 0, 3]
A = 0
B = 2

Output:

4

Explanation:

There are 4 possible groupings where the sum of the happiness values lies between 0 and 2, inclusive:

• The group with all members: [-1, 0, 3]
• The group with some members: [-1, 3]
• The group with a single member: [0]
• The empty group: [ ]

Constraints:

• 1 <= ‘T’ <= 100
• 1 <= ‘N’ <= 34
• -20,000,000 ≤ HAPPINESS[i] ≤ 20,000,000
• -500,000,000 ≤ A ≤ B ≤ 500,000,000
• Time Limit: 1 second

Input:

The first line of input contains an integer ‘T’, the number of test cases.
Each test case consists of:
The first line containing three integers: ‘N’, ‘A’, and ‘B’.
The next line contains ‘N’ integers denoting the happiness values.

Output:

For each test case, output the number of ways to form groups whose total happiness is within the specified range.

Note

No need to print anything; focus on implementing the solution.