Karan's mathematics professor has given him a lots of homework. Since he is busy preparing for September Easy Challenge, he needs your help.

Given two numbers, find the sum of prime numbers between them, both inclusive. 

Input:

The first line contains the number of test cases T. Each test case contains two space separated integers.

Output:

Print the answer on a new line for each case.

Constraints:

1 ≤ T ≤ 100

1 ≤ a,b < 10^6

SAMPLE INPUT
1
1 5

SAMPLE OUTPUT
10
import math
def is_prime(n):
    if (n % 2 == 0 and n > 2) or n < 2: 
        return False
    return all(n % i for i in range(3, int(math.sqrt(n)) + 1, 2))
tc = int(raw_input())
for i in range(0, tc):
	count = 0
	s = raw_input()
	n = map(int, s.split())
	for j in range(n[0], n[1] + 1):
		y = is_prime(j)
		if y == True:
			count = count + j
	print count