beecrowd | 1099

Sum of Consecutive Odd Numbers II

Adapted by Neilor Tonin, URI Brazil

Timelimit: 1

Read an integer N that is the number of test cases. Each test case is a line containing two integer numbers X and Y. Print the sum of all odd values between them, not including X and Y.

Input

The first line of input is an integer N that is the number of test cases that follow. Each test case is a line containing two integer X and Y.

Output

Print the sum of all odd numbers between X and Y.

Input Sample Output Sample

7

4 5

13 10

6 4

3 3

3 5

3 4

3 8

0

11

5

0

0

0

12