#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;

struct point
{
	int x, y;
	
	point() {}
	point(int a, int b): x(a), y(b) {}
	
	LL dis(point p)
	{
		return LL(abs(x - p.x)) + abs(y - p.y);
	}
};

point A, B, C;
int dx, dy;
int p = 0;
const int N = 1 << 18;
LL ans[N];
int a[N], b[N];

LL f(point X)
{
	LL d1 = A.dis(X) * b[p];
	LL d2 = B.dis(X) * a[p];
	LL d3 = C.dis(X) * a[p];
	return max(d1, d2) + d3;
}

LL g(int st)
{
	int cx = (C.x - A.x);
	if (dx) cx /= dx;
	int cy = (C.y - A.y);
	if (dy) cy /= dy;
	
	point pt(A.x, A.y);
	pt.x += cx * min(st, dx);
	pt.y += cy * min(max(0, st - dx), dy);
	LL a1 = f(pt);
	
	pt = point(A.x, A.y);
	pt.y += cy * min(st, dy);
	pt.x += cx * min(max(0, st - dy), dx);
	LL res = min(a1, f(pt));
	ans[p] = min(res, ans[p]);
	return res;
}


void solve()
{
	cin >> a[p] >> b[p];
	cin >> A.x >> A.y;
	cin >> B.x >> B.y;
	cin >> C.x >> C.y;
	ans[p] = A.dis(C) * b[p];
	
	dx = abs(A.x - C.x);
	dy = abs(A.y - C.y);
	
	LL lx = 0, rx = dx + dy;
	while (lx + 4 < rx)
	{
		LL d = (rx - lx) / 2;
		LL m1 = lx + d;
		LL m2 = lx + d + 1;
		if (g(m1) < g(m2))
			rx = m2;
		else
			lx = m1;
	}
	FOR (i, lx, rx + 1)
		g(i);
	p++;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int t;
	cin >> t;
	//scanf("%d", &t);
	FOR (tt, 0, t)
	{
		solve();
	}
	cout << fixed << setprecision(7);
	FOR (i, 0, t) cout << double(ans[i]) / (a[i] * b[i]) << '\n';
	
	return 0;
}