#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cassert>
#define RI register int
#define CI const int&
using namespace std;
int t,n,m;
int main()
{
    for (scanf("%d",&t);t;--t)
    {
        scanf("%d%d",&n,&m);
        int g=__gcd(n,m);
        auto dist=[&](CI x,CI y)
        {
            return sqrt(1LL*x*x+1LL*y*y);
        };
        if (g==1) { printf("%.15lf\n",dist(n,m)); continue; }
        double ans1=1e18;
        for (RI p=0;p<=n;++p)
        {
            for (RI q=1;q<=m;++q)
            {
                if (__gcd(p,q)!=1||__gcd(n-p,m-q)!=1||(p==n-p&&q==m-q)) continue;
                ans1=min(ans1,dist(p,q)+dist(n-p,m-q)); break;
            }
        }
        for (RI q=0;q<=m;++q)
        {
            for (RI p=1;p<=n;++p)
            {
                if (__gcd(p,q)!=1||__gcd(n-p,m-q)!=1||(p==n-p&&q==m-q)) continue;
                ans1=min(ans1,dist(p,q)+dist(n-p,m-q)); break;
            }
        }
        double ans2=dist(n/g,m/g),ret=1e18;
        n-=n/g; m-=m/g;
        for (RI p=0;p<=n;++p)
        {
            for (RI q=1;q<=m;++q)
            {
                if (__gcd(p,q)!=1||__gcd(n-p,m-q)!=1||(p==n-p&&q==m-q)) continue;
                ret=min(ret,dist(p,q)+dist(n-p,m-q)); break;
            }
        }
        for (RI q=0;q<=m;++q)
        {
            for (RI p=1;p<=n;++p)
            {
                if (__gcd(p,q)!=1||__gcd(n-p,m-q)!=1||(p==n-p&&q==m-q)) continue;
                ret=min(ret,dist(p,q)+dist(n-p,m-q)); break;
            }
        }
        printf("%.15lf\n",min(ans1,ans2+ret));
    }
}