#include <bits/stdc++.h>

using namespace std;

struct point {long long x,y;};
struct line {point h,t;}; const line x_axis={{0,0},{1,0}};
struct circle{point o;double r;};
const double eps=1e-15;

long long t,n,l,r,s,cnt,f,F,x,y;
double op;
vector<point> st,ms;
vector<pair<double,int> > p;

point operator+(point a,point b) {return (point){a.x+b.x,a.y+b.y};}
point operator-(point a,point b) {return (point){a.x-b.x,a.y-b.y};}

long long dot(point a,point b) {return a.x*b.x+a.y*b.y;}    
long long cx(point a,point b) {return a.x*b.y-a.y*b.x;}         
bool is_left(point a,point b) {return cx(a,b)<0;}        
bool is_right(point a,point b) {return cx(a,b)>0;}       

bool is_left(point b, line a) {return is_left(b-a.h,a.t-a.h);} 
bool is_right(point b, line a) {return is_right(b-a.h,a.t-a.h);} 

double inter(point a,point b,point c,point d) 
{
    double re,rat=(double)cx(a-c,d-c)/cx(d-c,b-a);
    re=(double)a.x+rat*(b.x-a.x);
    return re;
} 
double inter(line a,point b,point c) {return inter(a.h,a.t,b,c);}
double inter(line a,line b) {return inter(a.h,a.t,b.h,b.t);}

void tangent(vector<point> &ps1,vector<point> &ps2)
{
    int n1=ps1.size(),n2=ps2.size(),l,r1,r2,r,nxt,f1=0,f2=0;
    line l1,l2;
    l=r=0;
    while(is_left(ps1[(l+n1-1)%n1],{ps1[l],ps2[r]}) || is_left(ps1[(l+1)%n1],{ps1[l],ps2[r]}) || is_right(ps2[(r+n2-1)%n2],{ps1[l],ps2[r]}) || is_right(ps2[(r+1)%n2],{ps1[l],ps2[r]}))
    {
        while(is_left(ps1[(l+n1-1)%n1],{ps1[l],ps2[r]}) || is_left(ps1[(l+1)%n1],{ps1[l],ps2[r]}))
        {
            if(is_left(ps1[(l+1)%n1],{ps1[l],ps2[r]})) l=(l+1)%n1;
            else l=(l+n1-1)%n1;
        }
        while(is_right(ps2[(r+n2-1)%n2],{ps1[l],ps2[r]}) || is_right(ps2[(r+1)%n2],{ps1[l],ps2[r]}))
        {
            if(is_right(ps2[(r+1)%n2],{ps1[l],ps2[r]})) r=(r+1)%n2;
            else r=(r+n2-1)%n2;
        }
    }
    r2=r;
    l2={ps1[l],ps2[r]};
    l=r=0;
    while(is_right(ps1[(l+n1-1)%n1],{ps1[l],ps2[r]}) || is_right(ps1[(l+1)%n1],{ps1[l],ps2[r]}) || is_left(ps2[(r+n2-1)%n2],{ps1[l],ps2[r]}) || is_left(ps2[(r+1)%n2],{ps1[l],ps2[r]}))
    {
        while(is_right(ps1[(l+n1-1)%n1],{ps1[l],ps2[r]}) || is_right(ps1[(l+1)%n1],{ps1[l],ps2[r]}))
        {
            if(is_right(ps1[(l+1)%n1],{ps1[l],ps2[r]})) l=(l+1)%n1;
            else l=(l+n1-1)%n1;
        }
        while(is_left(ps2[(r+n2-1)%n2],{ps1[l],ps2[r]}) || is_left(ps2[(r+1)%n2],{ps1[l],ps2[r]}))
        {
            if(is_left(ps2[(r+1)%n2],{ps1[l],ps2[r]})) r=(r+1)%n2;
            else r=(r+n2-1)%n2;
        }
    }
    r1=r;
    l1={ps2[r],ps1[l]};
    if(l1.h.y>l1.t.y)
    {
        if(l1.h.y<0) {p.push_back(make_pair(inter(l1,x_axis),1));f1=1;}
        else if(l1.h.y==0 && ps2[(r1+1)%n2].y<0) {f1=1,p.push_back(make_pair(inter(l1,x_axis),1));}
    }
    else if(l1.h.y<l1.t.y)
    {
        if(l1.h.y>0) {f2=1;p.push_back(make_pair(inter(l1,x_axis),-1));}
        else if(l1.h.y==0 && ps2[(r1+1)%n2].y>0) {p.push_back(make_pair(inter(l1,x_axis),-1));f2=1;}
    }
    if(l2.h.y>l2.t.y && l2.t.y>0) {f1=1;p.push_back(make_pair(inter(l2,x_axis),1));}
    else if(l2.h.y<l2.t.y && l2.t.y<0) {f2=1,p.push_back(make_pair(inter(l2,x_axis),-1));}
    for(int i=r1;i!=r2;i=nxt)
    {
        nxt=(i+1)%n2;
        if(ps2[i].y>ps2[nxt].y && ps2[i].y>0) 
        {
            if(ps2[nxt].y<0) {f1=1,p.push_back(make_pair(inter(x_axis,ps2[i],ps2[nxt]),1));}
            else if(ps2[nxt].y==0 && ps2[(nxt+1)%n2].y<0) {f1=1,p.push_back(make_pair(inter(x_axis,ps2[i],ps2[nxt]),1));}
        }
        else if(ps2[i].y<ps2[nxt].y && ps2[i].y<0)
        {
            if(ps2[nxt].y>0) {f2=1,p.push_back(make_pair(inter(x_axis,ps2[i],ps2[nxt]),-1));}
            else if(ps2[nxt].y==0 && ps2[(nxt+1)%n2].y>0) {f2=1,p.push_back(make_pair(inter(x_axis,ps2[i],ps2[nxt]),-1));}
        }
    }
    if(f1!=f2)
    {
        if(f1==0) p.push_back(make_pair(-1e9-1,1));
        else p.push_back(make_pair(1e9+1,-1));
    }
}

bool cmp(pair<double,int> a,pair<double,int> b)
{
    return a.first!=b.first ? a.first<b.first : a.second<b.second;
}

void solve()
{
    scanf("%lld%lld%lld",&n,&l,&r);
    st.clear();
    op=0;
    cnt=0;
    f=0;
    F=0;
    p.clear();
    scanf("%ld",&s);
    for(int i=0;i<s;i+=1)
    {
        scanf("%lld%lld",&x,&y);
        st.push_back({x,y});
    }
    for(int j=0;j<n;j+=1)
    {
        ms.clear();
        scanf("%ld",&s);
        for(int i=0;i<s;i+=1)
        {
            scanf("%lld%lld",&x,&y);
            ms.push_back({x,y});
        }
        tangent(st,ms);
    }
    p.push_back(make_pair(l,2));
    p.push_back(make_pair(r,-2));
    sort(p.begin(),p.end(),cmp);
    for(int i=0;i<p.size()-1;i+=1)
    {
        if(p[i].second==1 || p[i].second==-1) cnt+=p[i].second;
        else if(p[i].second==2) f=1;
        else f=0;
        if(f==1 && cnt==0)
        {
            F=1;
            op+=p[i+1].first-p[i].first;
        }
    }
    if(F==1) printf("%.11lf\n",op);
    else printf("%d\n",-1);
}

int main()
{
    scanf("%lld",&t);
    while(t--) solve();
    return 0;
}