SP22455 SUMPRO - SUM OF PRODUCT

Given a number **N**, find the sum of all products x\*y such that N/x = y (**Integer Division**). Since, the sum can be very large, please output this modulo **1000000007**.

The first line of input file contains an integer **T**, the number of test cases to follow. Each of the next T lines contain an integer **N**.

Output **T** lines containing answer to corresponding test case.

对于 $100\%$ 的数据，$T \le 500,N \le 10^9$。