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 sum_prime(x,y):
    lst = []
    sum1 = 0
    for i in range(x,y+1):
        flag = 0
        for j in range(2,int(math.sqrt(i))+1):
            if i % j == 0:
                flag = 1
                break
        if flag == 0:
            #print(i)
            sum1 += i
    return sum1


if __name__=='__main__':
    t = int(raw_input())
    for i in range(0,t):
        x,y = map(int,raw_input().split())
        if x==1:
            x += 1
        print sum_prime(x,y)