#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll L,R;

bool check(ll u)
{
    ll f;
    if(L%u==0)
    {
        f=L/u;
    }else f=L/u+1;
    ll s=f*u;
    if(R-s>=u) return true;
    else return false;
}




void solve()
{
    cin>>L>>R;
    ll ans=0;
    // for(ll i=7007007007-;i<=7007007007;i++)
    // {
    //     cout<<check(i)<<endl;
    // }
    for(ll l=1,r;l<=L;l=r+1)
    {
     	r=L/(L/l);//定义右边界 
	    if(check(l)==0&&check(r)==0) continue;
        if(check(l))
        {
            ll l1=l,r1=r;
            while(l1<r1)
            {
               ll mid=l1+r1+1>>1;
               if(check(mid)) l1=mid;
               else r1=mid-1;
            }
            ans=max(ans,l1);
        }else
        {
            ll l1=l,r1=r;
            while(l1<r1)
            {
               ll mid=l1+r1+1>>1;
               if(!check(mid)) l1=mid;
               else r1=mid-1;
            }
            ans=max(ans,l1+1);
        }
        if(check(r)) ans=max(ans,r);
    }
    //cout<<check(129)<<endl;
    cout<<ans<<'\n';
}

int main()
{
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}