ctrl-hack

def isPrime(n):
    #print("isprime")
    if n<=1:
        return False
    for i in range(2, (n//2)+1):
        if n%i==0:
            return False
    return True

def dbyi(q):
    #print("dbyi")
    if q==1:return 0
    if q==2:return 1
    elif q%2!=0:
        if isPrime(q):return 1
    else:
        for j in range(2,q):
            if q%j==0:
                #print(q/j,j,"in dbyi")
                return ((q//j)*dbyi(j))+(j*dbyi(q//j))
def divisors(p):
    #print("divisors")
    print(p)
    if p!=2 and p%2!=0:
        if isPrime(p):return 1
    sum=dbyi(p)
    for i in range(2,(p//2) +1):
        if p%i==0:
            #print(sum,"in divisors")
            sum+=dbyi(i)

    print(sum,"in divisors")
    return sum

def strange_sum(L,R):
    #print("strange sum")
    out=0
    for k in range(L,R+1):
        out+=divisors(k)
        #print(out,"in strange sum")
    return out


for _ in range(int(input())):
    inp=list(map(int,input().split()))
    L=inp[0]
    R=inp[1]
    #print(L,R)
    out=strange_sum(L,R)
    print(out)