#include<bits/stdc++.h>
using namespace std;
using ll=long long;

void solve(){
    ll A,B;
    cin>>A>>B;
    set<ll> S;
    S.insert(A+1);
    S.insert(B+1);
    ll d=1;
    while(d<=B){
        ll L=B/d;
        ll R=B/(d+1);
        S.insert(R+1);
        if(R==0)break;
        d=B/R;
    }
    d=1;
    while(d<=A){
        ll L=A/d;
        ll R=A/(d+1);
        S.insert(R+1);
        if(R==0)break;
        d=A/R;
    }
    vector<ll> D;
    for(int s:S)D.push_back(s);
    ll dn=D.size();
    ll an=0;
    for(int i=0;i<dn-1;i++){
        ll f=B/D[i]-A/D[i];
        ll res=0;
        if(f==0){
            // res=D[i+1]-D[i];
        }
        else res=max(D[i+1]-max(D[i],(B-A+f-1)/f),0ll);
        an+=res;
    }
    cout<<an<<endl;;
}

int main(){
   ll T;
   cin>>T;
   while(T--)solve();
}