#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
using vec=complex<int>;
using ld=long double;
ll dot(const vec &a,const vec &b){
	return 1ll*real(a)*real(b)+1ll*imag(a)*imag(b);
}
ll cross(const vec &a,const vec &b){
	return dot(a,b*vec(0,-1));
}
struct frac{
	ll x,y;
	frac()=default;
	frac(ll a,ll b=1):x(a),y(b){}
	ld calc()const{
		return (ld)x/y;
	}
};
#ifdef DEBUG
ostream& operator << (ostream &out,frac a){
	return out<<a.calc();
}
#endif
using LL=__int128;
bool operator < (const frac &a,const frac &b){
	return (LL)a.x*b.y<(LL)b.x*a.y;
}
template<class T>
int sign(const T &x){
	return x?(x>0?1:-1):0;
}
int T,n,L,R;
using poly=vector<vec>;
poly a,b;
void read(poly &a){
	int k;
	scanf("%d",&k);
	a.resize(k);
	for(int i=0,x,y;i<k;i++){
		scanf("%d%d",&x,&y);
		a[i]=vec(x,y);
	}
}
pair<int,int> find(vec s,const poly &a){
	int n=a.size(),st=0;
	if(!cross(a[0]-s,a[1]-s))st=1;
	int op=sign(cross(a[st]-s,a[st+1]-s));
	int l=0,r=n,mid;
	for(;l+1<r;){
		mid=(l+r)>>1;
		if(sign(cross(a[st]-s,a[(st+mid)%n]-s))==op)l=mid;
		else r=mid;
	}
	auto find=[&](int st,int len,int op){
		int l=0,r=len,mid;
		for(;l<r;){
			mid=(l+r)>>1;
			int u=(st+mid)%n,v=(u+1)%n;
			if(sign(cross(a[u]-s,a[v]-s))==op)l=mid+1;
			else r=mid;
		}
		return (st+l)%n;
	};
	int p=find(st,l,op),q=find((st+r)%n,(n-r)%n,-op);
	return op>0?make_pair(p,q):make_pair(q,p);
}
frac calc(vec a,vec b){
	ll s=cross(b-L,a-L),t=cross(a-R,b-R);
	if(s<0)s=-s,t=-t;
	return frac(s,s+t);
}
vector<pair<frac,int>>c;
bool solve(){
	int n=b.size();
	auto [s,t]=find(a[0],b);
	int x=[&](){
		int l=0,r=(t-s+n)%n,mid;
		for(;l<r;){
			mid=(l+r)>>1;
			int u=(s+mid)%n,v=(u+1)%n;
			if(cross(b[v]-b[u],a[find(b[u],a).first]-b[u])>0)l=mid+1;
			else r=mid;
		}
		return (s+l)%n;
	}();
	int y=[&](){
		int l=0,r=(t-s+n)%n,mid;
		for(;l<r;){
			mid=(l+r)>>1;
			int u=(t-mid+n)%n,v=(u+n-1)%n;
			if(cross(a[find(b[u],a).second]-b[u],b[v]-b[u])>0)l=mid+1;
			else r=mid;
		}
		return (t-l+n)%n;
	}();
	int p=find(b[x],a).first;
	int q=find(b[y],a).second;
	auto chkin=[&](vec u,int o1,int o2){
		return
			cross(a[p]-b[x],u-b[x])>=o1&&
			cross(b[y]-b[x],u-b[x])>=0&&
			cross(u-b[y],a[q]-b[y])>=o2;
	};
	if(chkin(L,1,0)&&chkin(R,0,1))return 0;
	if(chkin(R,1,0)&&chkin(L,0,1))return 0;
	auto check=[&](vec s,vec t){
		ll p=cross(R-L,t-L),q=cross(R-L,s-L);
		if(sign(p)*sign(q)<=0||abs(p)>=abs(q))return false;
		return sign(cross(t-s,L-s))*sign(cross(t-s,R-s))<0;
	};
	int o1=check(a[p],b[x]),o2=check(a[q],b[y]);
	if(o1&&o2){
		frac s=calc(a[p],b[x]),t=calc(a[q],b[y]);
		if(t<s)swap(s,t);
		c.push_back({s,1});
		c.push_back({t,-1});
	}else if(o1){
		frac s=calc(a[p],b[x]);
		if(cross(a[p]-b[x],L-b[x])>0){
			c.push_back({frac(0),1});
			c.push_back({s,-1});
		}else{
			c.push_back({s,1});
			c.push_back({frac(1),-1});
		}
	}else if(o2){
		frac s=calc(a[q],b[y]);
		if(cross(L-b[y],a[q]-b[y])>0){
			c.push_back({frac(0),1});
			c.push_back({s,-1});
		}else{
			c.push_back({s,1});
			c.push_back({frac(1),-1});
		}
	}
	return 1;
}
void work(){
	scanf("%d%d%d",&n,&L,&R);
	read(a);
	c.clear();
	ld ans=0;
	bool flag=0;
	for(int i=1;i<=n;i++){
		read(b);
		if(!solve())flag=1;
	}
	if(flag)return puts("-1"),void();
	c.push_back({frac(0),0});
	c.push_back({frac(1),0});
	sort(all(c));
	for(int i=0,x=0;i+1<c.size();i++){
		x+=c[i].second;
		if(!x){
			ans+=c[i+1].first.calc()-c[i].first.calc();
			if(frac(0)<c[i].first&&c[i].first<frac(1))flag=1;
			if(c[i].first<c[i+1].first)flag=1;
		}
	}
	ans*=abs(R-L);
	if(flag)printf("%.15Lf\n",ans);
	else puts("-1");
}
int main(){
	for(scanf("%d",&T);T--;)work();
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif