#include <bits/stdc++.h>

using namespace std;

struct point {long long x,y;};
struct line {point h,t;};

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

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(line a) {return (double)cx(a.h,a.t)/(double)(a.t.y-a.h.y);}

void inter(vector<line> &ls)
{
    int f1=0,f2=0;
    for(int i=0;i<ls.size();i+=1)
    {
        if(i==ls.size()-1)
        {
            if(ls[i].h.y>ls[i].t.y && ls[i].h.y>0) {f1=1;p.push_back(make_pair(ls[i],1));}
            else if(ls[i].h.y<ls[i].t.y && ls[i].h.y<0) {f2=1;p.push_back(make_pair(ls[i],-1));}
        }
        else if(i==0)
        {
            if(ls[i].h.y>ls[i].t.y)
            {
                if(ls[i].t.y<0) {f1=1;p.push_back(make_pair(ls[i],1));}
                else if(ls[i].t.y==0 && ls[i+1].t.y<0) {f1=1;p.push_back(make_pair(ls[i],1));}
            }
            else if(ls[i].h.y<ls[i].t.y)
            {
                if(ls[i].t.y>0) {f2=1;p.push_back(make_pair(ls[i],-1));}
                else if(ls[i].t.y==0 && ls[i+1].t.y>0) {f2=1;p.push_back(make_pair(ls[i],-1));}
            }
        }
        else
        {
            if(ls[i].h.y>ls[i].t.y && ls[i].h.y>0)
            {
                if(ls[i].t.y<0) {f1=1;p.push_back(make_pair(ls[i],1));}
                else if(ls[i].t.y==0 && ls[i+1].t.y<0) {f1=1;p.push_back(make_pair(ls[i],1));}
            }
            else if(ls[i].h.y<ls[i].t.y && ls[i].h.y<0)
            {
                if(ls[i].t.y>0) {f2=1;p.push_back(make_pair(ls[i],-1));}
                else if(ls[i].t.y==0 && ls[i+1].t.y>0) {f2=1;p.push_back(make_pair(ls[i],-1));}
            }
        }
    }
    if(f1==0 && f2==1) p.push_back(make_pair((line){{-1000000001,0},{-1000000001,1}},1));
}

void tangent(vector<point> &ps1,vector<point> &ps2)
{
    int n1=ps1.size(),n2=ps2.size(),l,r1,r2,r,nxt;
    line l1,l2;
    ls.clear();
    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={ps2[r],ps2[r]+ps2[r]-ps1[l]};
    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]-ps2[r]),ps2[r]};
    ls.push_back(l1);
    for(int i=r1;i!=r2;i=nxt)
    {
        nxt=(i+1)%n2;
        ls.push_back({ps2[i],ps2[nxt]});
    }
    ls.push_back(l2);
    inter(ls);
}

bool cmp(pair<line,int> p1,pair<line,int> p2)
{
    long long a=cx(p1.first.h,p1.first.t),c=cx(p2.first.h,p2.first.t);
    int b=p1.first.t.y-p1.first.h.y,d=p2.first.t.y-p2.first.h.y;
    long long e=b*d;
    long long X=a*d,Y=b*c;
    if(X==Y) return p1.second<p2.second;
    if(e>0) return X<Y;
    return X>Y;
}

bool cmp2(pair<line,int> p1,pair<line,int> p2)
{
    double a=cx(p1.first.h,p1.first.t)/(p1.first.t.y-p1.first.h.y),b=cx(p2.first.h,p2.first.t)/(p2.first.t.y-p2.first.h.y);
    return a==b ? p1.second<p2.second : a<b;
}

void solve()
{
    scanf("%lld%lld%lld",&n,&l,&r);
    st.clear();
    op=0;
    cnt=0;
    f=0;
    F=0;
    p.clear();
    scanf("%lld",&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("%lld",&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((line){{l,0},{l,1}},2));
    p.push_back(make_pair((line){{r,0},{r,1}},-2));
    sort(p.begin(),p.end(),cmp2);
    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 break;
        if(f==1 && cnt==0)
        {
            F=1;
            op+=inter(p[i+1].first)-inter(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;
}