#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e4+5;
const double pi=acos(-1),eps=1e-12;
struct node{
	double x,y;
	friend node operator-(node a,node b){
		return {a.x-b.x,a.y-b.y};
	}
	friend node operator*(double a,node b){
		return {a*b.x,a*b.y};
	}
	friend node operator+(node a,node b){
		return {a.x+b.x,a.y+b.y};
	}
}p1[N],p2[N],st,ed;
double nw,f1[N],f2[N];
struct msg{
	double x;
	int bh,op;
	friend bool operator<(msg a,msg b){
		return a.x<b.x;
	}
};
node gets(node a,node b){
	return a+((nw-a.y)/(b.y-a.y))*(b-a);
}
struct nds{
	node a,b;
	friend bool operator<(nds a,nds b){
		return abs(gets(a.a,a.b).x)<abs(gets(b.a,b.b).x)-eps;
	}
};
double jd1(nds x){
	node a=x.a,b=x.b,t=b-a;
	return pi/2-atan2(t.y,t.x);
}
double jd2(nds x){
	node a=x.a,b=x.b,t=b-a;
	return atan2(t.y,t.x)-pi/2;
}
node rot(node a,double x){
	return {a.x*cos(x)-a.y*sin(x),a.x*sin(x)+a.y*cos(x)};
}
double k;
int t,n;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>t;
	while(t--){
		memset(f1,0,sizeof(f1));
		memset(f2,0,sizeof(f2));
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>p1[i].x>>p1[i].y>>p2[i].x>>p2[i].y;
		}
		cin>>st.x>>st.y>>ed.x>>ed.y>>k;
		node to=ed-st;
		double tmp=atan2(to.y,to.x)-pi/2;
		tmp=2*pi-tmp;
		st=rot(st,tmp);ed=rot(ed,tmp);
		vector<msg>q;
		for(int i=1;i<=n;i++){
			p1[i]=rot(p1[i],tmp);
			p2[i]=rot(p2[i],tmp);
			p1[i]=p1[i]-st;
			p2[i]=p2[i]-st;
			if(p1[i].y>p2[i].y)swap(p1[i],p2[i]);
			q.push_back({p1[i].y,i,0});
			q.push_back({p2[i].y,i,1});
		//	cout<<p1[i].x<<" "<<p1[i].y<<" "<<p2[i].x<<" "<<p2[i].y<<endl;
		}
		set<nds>jl1,jl2;
		sort(q.begin(),q.end());
		for(int i=0;i<q.size();i++){
			double x=q[i].x;
			int bh=q[i].bh,op=q[i].op;
			if(jl1.size())f1[i]=1/cos(jd1(*jl1.begin()));
			if(jl2.size())f2[i]=1/cos(jd2(*jl2.begin()));
			nw=x;
			if(op==0){
				if(p1[bh].x>0)jl1.insert({p1[bh],p2[bh]});
				else jl2.insert({p1[bh],p2[bh]});
			}else{
				if(p1[bh].x>0)jl1.erase(jl1.find({p1[bh],p2[bh]}));
				else jl2.erase(jl2.find({p1[bh],p2[bh]}));
			}
		}
		int lst=0;
		double ans=0,res=0;
		for(int i=1;i<q.size();i++){
			ans+=(q[i].x-q[i-1].x)*(f1[i]+f2[i]);
			while(q[i].x-q[lst].x>k)lst++,ans-=(q[lst].x-q[lst-1].x)*(f1[lst]+f2[lst]);
			res=max(res,ans+(k-(q[i].x-q[lst].x))*(f1[lst]+f2[lst]));
		}
		lst=q.size()-1;
		ans=0;
		for(int i=q.size()-2;i>=0;i--){
			ans+=(q[i+1].x-q[i].x)*(f1[i+1]+f2[i+1]);
			while(q[lst].x-q[i].x>k)ans-=(q[lst].x-q[lst-1].x)*(f1[lst]+f2[lst]),lst--;
			res=max(res,ans+(k-(q[lst].x-q[i].x))*(f1[lst+1]+f2[lst+1]));
		}
		printf("%.10lf\n",res);
	}
}