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

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long double db;


db dist(db x0, db y0, db x1, db y1, db v){
	return (abs(x0 - x1) + abs(y0 - y1)) / v;
} 

int xA, yA, xB, yB, xC, yC;
int a, b;

db d(db x, db y){
	return max(dist(xA, yA, x, y, a), dist(xB, yB, x, y, b)) + dist(x, y, xC, yC, b);
}

db findY(db x){
	db Ly = -1e9, Ry = 1e9;
	FOR(it, 0, 300){
		db m1y = (2 * Ly + Ry) / 3.0;
		db m2y = (Ly + 2 * Ry) / 3.0;
		
		if(d(x, m1y) > d(x, m2y))
			Ly = m1y;
		else
			Ry = m2y;
	}
	return d(x, Ry);
}


void solve(){
	cin >> a >> b;	
	cin >> xA >> yA >> xB >> yB >> xC >> yC;
	
	
	db ans = dist(xA, yA, xC, yC, a);
	db Lx = -1e9, Rx = 1e9;
	FOR(it, 0, 300){
		db m1x = (2 * Lx + Rx) / 3.0;
		db m2x = (Lx + 2 * Rx) / 3.0;
		
		if(findY(m1x) > findY(m2x))
			Lx = m1x;
		else
			Rx = m2x;
	}
	ans = min(ans, findY(Rx));
	
	
	cout << fixed << setprecision(10) << ans << "\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);


	int t;
	cin >> t;
	while(t--)
		solve();
		
	//cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	
	
	return 0;
}