import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
######################################################################

def floor_decomposition(x): # k = floor(x / i) (L < i <= R) となる (k, L, R) のリストを返す
    res = []
    R = 10 ** 18
    while R:
        q = x // R
        L = x // (q + 1)
        res.append((q, L, R))
        R = L
    return res

def ceil_decomposition(x): # k = ceil(x / i) (L < i <= R) となる (k, L, R) のリストを返す
    res = []
    R = 10 ** 18
    while R:
        q = (x - 1) // R + 1
        L = (x - 1) // q
        res.append((q, L, R))
        R = L
    return res


for _ in range(ni()):
    a, b = na()
    FA = floor_decomposition(a)
    FB = floor_decomposition(b)
    C = ceil_decomposition(b - a)

    ZA = -1
    ZB = -1
    ZC = -1

    eve = []
    for k, L, R in FA:
        eve.append((L, k, 0))
    
    for k, L, R in FB:
        eve.append((L, k, 1))
    
    for k, L, R in C:
        eve.append((L, k, 2))
    

    eve.sort()
    X = 0
    ans = 0
    for L, k, t in eve:
        if ZB - ZA >= ZC:
            ans += L - X
        X = L
        if t == 0:
            ZA = k
        elif t == 1:
            ZB = k
        else:
            ZC = k
    print(ans)