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.
Input
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
Output T lines containing answer to corresponding test case.
Example
Input:
3 2 4 6
Output:
4 15 33
Constraints:
1 ≤ T ≤ 500
1 ≤ N ≤ 10^{9}
^{}
Sample Explanation:
Case #1:
2 / 1 = 2
2 / 2 = 1
Answer = 1 * 2 + 2 * 1 = 4
Case #2:
4 / 1 = 4
4 / 2 = 2
4 / 3 = 1
4 / 4 = 1
Answer = 1 * 4 + 2 * 2 + 3 * 1 + 4 * 1 = 15
hide comments
Shubham Jadhav:
20200628 20:35:58
Beautiful Problem 

ck_17:
20200608 10:55:47
jut write down few test cases and observe. ex 12 

hung02:
20200518 18:24:41
Awwwww AC finally :D 1.43s 4.3M O(2*sqrt(n))


landi58:
20200508 20:24:42
Hi, can anyone please help me to solve this question in O(sqrt(n)). I am trying hard and ablw to solve in n/2 but not in sqrt(n). Please tell how to solve this. 

nadstratosfer:
20200404 17:01:50
tejas_vi: sumbit in PyPy: https://www.spoj.com/ranks/SUMPRO/lang=PYPY2.4


tejas_vi:
20200404 15:23:59
Its an Easy question but my python code is showing (time limit exceeded) but on ideone the following message pops ((Success #stdin #stdout 0.01s 7184KB)), idk whats wrong with SPOJ 

surajmall:
20191210 20:01:01
very good question !! must try 

anirudnits:
20190103 18:38:37
if you're stuck https://codeforces.com/problemset/problem/616/E. Last edit: 20190103 19:07:02 

sanjana_17:
20180628 11:48:36
really nice problem.......pen and copy can only save!! 

nimphy:
20180521 09:37:52
easy one comparing with those problems I met these days~ 
Added by:  ivar.raknahs 
Date:  20150123 
Time limit:  1s1.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Own 