import math

n = 2 * 10**5 + 10

pf = [0] * n
for i in range(n):
    pf[i] = i

for i in range(2, n):
    if pf[i] == i:
        j = 2 * i
        while j < n:
            pf[j] = i
            j = j + i
# print(pf)

phi = [1] * n
for i in range(2, n):
    x = i
    pp = -1
    while x > 1:
        p = pf[x]
        if p == pp:
            phi[i] *= p
        else:
            phi[i] *= p - 1
        pp = p
        x //= p
# print(phi)

acc = [0] * (n + 1)
for i in range(2, n):
    acc[i] = acc[i - 1] + phi[i]


import re
import sys

content = input()
pattern = r'^(\d+)$'
result = re.match(pattern, content)

if not result:
    sys.exit("format error.")

T = int(content)

prv = 0

for t in range(T):
    content = input()
    pattern = r'^(\d+) (\d+)$'
    result = re.match(pattern, content)

    if not result:
        sys.exit("format error.")

    l, r = map(int, content.split())

    if not (0 <= l and l <= 10**18):
        sys.exit("alpha")
    if not (0 <= r and r <= 10**18):
        sys.exit("beta")

    l ^= prv
    r ^= prv

    if not (2 <= l and l <= r and r <= 2 * 10**5):
        sys.exit("L, R")
    
    l -= 1

    res = 0
    
    sqrtR = int(math.sqrt(l + r))

    for i in range(2, sqrtR + 1):
        if l // i != r // i:
            res += phi[i]
    
    i1 = 0
    i2 = 1
    q_prv = r
    while q_prv > sqrtR:
        ql = l // (i1 + 1)
        qr = r // (i2 + 1)
        q_max = max(ql, qr)
        if i1 != i2:
            res += acc[q_prv] - acc[max(q_max, sqrtR)]
            # print(i1, i2, max(q_max, sqrtR), q_prv)
        
        q_prv = q_max
        if ql >= qr:
            i1 += 1
        else:
            i2 += 1
    
    print(res)
    
    prv = res