#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int n,m;

int p[maxn],c[maxn],sum;
double t[maxn];

bool chk(double T){
	int now=0,cnt=m;
	Rep(i,n,1){
		if(now>=c[i]){
			now-=c[i];
			continue;
		}
		int nd=c[i]-now; now=0;
		int can=floor((T-t[i])/0.89);
		if(!can)return 0;
		int go=(nd+can-1)/can;
		cnt-=go;
		if(cnt<0)return 0;
		now+=go*can-nd;
	}
	return 1;
}

void work()
{
	n=read(),m=read();
	sum=0;
	For(i,1,n){
		int l=read(),r=read(),h=read(),s=read();
		c[i]=(h+s+23)/24;
		sum+=c[i];
		p[i]=max(l-6,0ll);
		t[i]=1.0*p[i]/5.25;
	}
//	cout<<"qwq\n";
//	For(i,1,n)cout<<c[i]<<" ";puts("");
	double l=t[n]+0.89,r=1e18;
//	chk(49.2);exit(0);
	For(i,1,120){
		double mid=(l+r)/2;
//		cout<<"wk "<<l<<" "<<r<<"\n";
		if(chk(mid))r=mid;
		else l=mid;
	}
	printf("%.5lf\n",l);
}

signed main()
{
//	freopen("data.in","r",stdin);
	int T=read();
	while(T--)work(); 
	return 0;
}