/*** WORK : 省赛\2023gdcpc\G.cpp ***/
/*** TIME : 2024/11/23 18:55 ***/
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define pb push_back
#define se second
#define fi first
#define int long long
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int MOD = (int) 1e9 + 7;
const int INF = INT_MAX;
// L*2 >= r
int gcd(int x,int y){
    return x%y==0 ? y:gcd(y,x%y);
}
void solve() {
    int L,R;
    cin >> L >> R;
    int gd = gcd(L,R);
    L/=gd;
    R/=gd;
    int l=2,r=R,ans=0;
    while(l<=r){
        int mid = l + r >> 1;
        int t = R/mid;
        // t*=mid;
        // cout << R <<" " << t << endl;
        if(R/t*t - t >= L){
            r = mid - 1;
            ans = mid;
        }else{
            l = mid + 1;
        }
    }
    int ans1 = (R/ans)*gd;
    L*=gd;
    R*=gd;
    l=2,r=R,ans=0;
    while(l<=r){
        int mid = l + r >> 1;
        int t = R/mid;
        if(R/t*t - t >= L){
            r = mid - 1;
            ans = mid;
        }else{
            l = mid + 1;
        }
    }
    
    int ans2 = (R/ans);
    cout << max(ans1,ans2) << endl;
}

int32_t main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int T = 1;
    cin>>T;
    while (T--)solve();
}