#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 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 checkY(db y){
	db Lx = min({xA, xB, xC}), Rx = max({xA, xB, xC});
	FOR(it, 0, 60){
		db m1x = (2 * Lx + Rx) / 3.0;
		db m2x = (Lx + 2 * Rx) / 3.0;
		
		if(d(m1x, y) > d(m2x, y))
			Lx = m1x;
		else
			Rx = m2x;
	}
	return d(Rx, y);
}


void solve(){
	scanf("%d%d", &a, &b);	
	scanf("%d%d%d%d%d%d", &xA, &yA, &xB, &yB, &xC, &yC);	

	
	db ans = dist(xA, yA, xC, yC, a);
	FOR(t, 0, 2){		
		ans = min(ans, checkY(yA));
		ans = min(ans, checkY(yB));
		ans = min(ans, checkY(yC));


		swap(xA, yA);
		swap(xB, yB);
		swap(xC, yC);
	}	
	printf("%.6lf\n", ans);
}

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


	int t;
	scanf("%d", &t);
	
	//cin >> t;
	
	while(t--)
		solve();
		
	//cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	
	
	return 0;
}