#include<bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
int x,y;
double calc(int xx,int yy){
    if(!(__gcd(xx,yy)==1&&__gcd(x-xx,y-yy)==1)) return 1e9;
    if((double)(yy*1.0/xx)==(double)((y-yy)*1.0/(x-xx))) return 1e9;
    return hypot(xx,yy)+hypot(x-xx,y-yy);
}
void solve(){
    cin>>x>>y;
    if(__gcd(x,y)==1) return cout<<fixed<<setprecision(9)<<hypot(x,y)<<endl,void();
    double res=x+y;
    for(int i=1;i<x;i++){
        if(__gcd(x-i,y)==1) res=min(res,hypot(x-i,y)+i);
    }
    for(int i=1;i<y;i++){
        if(__gcd(y-i,x)==1) res=min(res,hypot(y-i,x)+i);
    }
    double k=(double)(y*1.0/x);
    for(int i=1;i<x;i++){
        double j=k*i;
        int yy=j;
        if(yy<y) res=min(res,calc(i,yy));
        if(yy+1<y) res=min(res,calc(i,yy+1));
        if(yy-1<y) res=min(res,calc(i,yy-1));
    }
    cout<<fixed<<setprecision(9)<<res<<endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/