Count Set Bits Problem Statement

Given a positive integer N, find the total number of '1's in the binary representation of all the numbers from 1 to N.

You should return the result modulo 10⁹+7 as the count can be large.

Input:

The first line contains an integer ‘T’ representing the number of test cases. 
Each of the next ‘T’ lines contains a single integer ‘N’.

Output:

For each test case, output a single integer which is the count of set bits in the binary representation of all numbers from 1 to N, modulo 109+7. 
Each test case's output should be printed on a new line.

Example:

Suppose T = 2 with the following test cases:

Test case 1:
N = 3

Test case 2:
N = 5

Output:

Test case 1 output:
4

Test case 2 output:
7

Explanation:

For test case 1, numbers are 1, 10, and 11 in binary, with a total of 4 set bits.
For test case 2, numbers are 1, 10, 11, 100, and 101, totaling 7 set bits.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 109
• Time limit of 1 second