#include<bits/stdc++.h>
using std::cin, std::cout;
using db = long double;
using f128 = __float128;
using ll = long long;
const db eps = 1e-12;
struct p2 {
	db x, y;
	db abs() {
		return sqrt(x * x + y * y);
	}
};
p2 operator - (p2 x, p2 y) {
	return {x.x - y.x, x.y - y.y};
}
db operator * (p2 x, p2 y) {
	return x.x * y.y - x.y * y.x;
}
p2 findmin(std::vector<p2> & a, auto cmp) {
	int l = 0, r = a.size() - 1, d = 1;
	if(cmp(a.back(), a[0])) std::swap(l, r), d = -1;
	for(;(r - l) * d > 1;) {
		int mid = (l + r) >> 1;
		if(cmp(a[mid], a[mid - d]) && cmp(a[mid], a[l])) {
			l = mid;
		} else {
			r = mid;
		}
	}
	return a[l];
}
const int N = 500005;
std::vector<p2> star, moon[N];
std::vector<p2> read() {
	int n; cin >> n;
	std::vector<p2> a(n);
	for(int i = 0;i < n;++i) {
		int x, y; cin >> x >> y;
		a[i] = {x, y};
	}
	return a;
}

p2 r90(p2 x) {
	return {-x.y, x.x};
}
struct line : p2 {
	db z;
	line(p2 a, p2 b) : p2(r90(b - a)), z(a * b) {}
};
using i128 = __int128;
struct frac {
	ll u, v;
	frac(ll A, ll B = 1) {
		u = A, v = B;
		if(v < 0) u *= -1, v *= -1;
	}
	bool operator == (const frac & b) const {
		return (i128) u * b.v == (i128) v * b.u;
	}
	bool operator < (const frac & b) const {
		return (i128) u * b.v < (i128) b.u * v;
	}
	f128 val() const {
		return (f128) u / v;
	}
};
int n;
db l, r;
void solve() {
	cin >> n >> l >> r;
	star = read();
	for(int i = 0;i < n;++i) {
		moon[i] = read();
	}
	std::vector<std::pair<frac, int>> o;
	o.emplace_back(frac(l), 1);
	o.emplace_back(frac(r), -1);
	for(int i = 0;i < n;++i) {
		p2 u[2], v[2];
		auto & A = star, & B = moon[i];
		for(int s = 0;s < 2;++s) {
			p2 S;
			int sgn = s ? 1 : -1;
			auto cmp0 = [&](p2 x, p2 y) {
				return (x - S) * (y - S) * sgn > 0;
			};
			auto cmp1 = [&](p2 x, p2 y) {
				S = x; p2 u = findmin(B, cmp0);
				S = y; p2 v = findmin(B, cmp0);
				return (u - x) * (v - y) * sgn > 0;
			};
			S = u[s] = findmin(A, cmp1), v[s] = findmin(B, cmp0);
		}
		frac L = l - 1, R = r + 1;
		auto add = [&](p2 u, p2 v) {
			line li(u, v);
			if(fabs(li.x) < eps) {
				if(li.z < eps) {
					L = r + 1, R = l;
				}
			} else {
				if(li.x > 0) {
					L = std::max(L, frac(-li.z, li.x));
				} else {
					R = std::min(R, frac(-li.z, li.x));
				}
			}
		};
		add(v[0], u[0]);
		add(u[1], v[1]);
		if((v[0] - v[1]).abs() > 1e-9) {
			add(v[0], v[1]);
		}
		if(L < R) {
			o.emplace_back(L, -1);
			o.emplace_back(R, 1);
		}
	}
	db ans = 0;
	sort(o.begin(), o.end(), [](auto x, auto y) {
		auto [x0, x1] = x;
		auto [y0, y1] = y;
		if(x0 == y0) {
			return x1 > y1;
		}
		return x0 < y0;
	});
	int count = 0, ok = 0;
	for(int i = 0;i + 1 < (int) o.size();++i) {
		count += o[i].second;
		if(count > 0) {
		  
			ans += o[i + 1].first.val() - o[i].first.val();
			if(o[i + 1].first == o[i].first) {
			  if(o[i].first == frac(l)) continue;
			  if(o[i].first == frac(r)) continue;
			}
			ok = 1;
		}
	}
	if(ok) {
		printf("%.13Lf\n", ans);
	} else {
		puts("-1");
	}

}
int main() {
//	freopen("1.in", "r", stdin);
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T; cin >> T;
	for(int i = 0;i < T;++i) {
		solve();
	}
}