Odd Divisors

All submissions for this problem are available.
Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.
Little Egor likes to play with positive integers and their divisors. Bigger the number to play with, more the fun! The boy asked you to come up with an algorithm, that could play the following game:
Let's define f(n) as the sum of all odd divisors of n. I.e. f(10) = 1 + 5 = 6 and f(21) = 1 + 3 + 7 + 21 = 32. The game is to calculate f(l) + f(l + 1) + ... + f(r  1) + f(r) for the given integers l and r.
Have fun! But be careful, the integers might be quite big.
Input
The first line of the input contains one integer T denoting the number of test cases.
The only line of the test case description contains two positive integers l and r.
Output
For each test case, output the required sum on a separate line.
Constraints
 1 ≤ T ≤ 10
 1 ≤ l ≤ r ≤ 10^{5}
Example
Input: 2 1 10 42 42 Output: 45 32
Explanation
In the first example case, f(1) + f(2) + ... + f(10) = 1 + 1 + 4 + 1 + 6 + 4 + 8 + 1 + 13 + 6 = 45
In the second example case, f(42) = 32.
Author:  kostya_by 
Tester:  pavel1996 
Editorial  http://discuss.codechef.com/problems/ODDDIV 
Tags  cook69 divisors kostya_by simple sum 
Date Added:  26032016 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.3.2, CPP 4.9.2, CPP14, CS2, D, ERL, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYPY, PYTH, PYTH 3.4, RUBY, SCALA, SCM chicken, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions