#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
typedef long long ll;
typedef double db;
#define int long long
const int N=2e5+50;
struct node {
    int l,r,h,s;
} a[N];
int b[N];
int n,m;
bool check(db mid) {
    FOR(i,1,n) b[i]=a[i].h+a[i].s;
    int p=n;
    ll cnt=0;
    while(true) {
        while(p && !b[p]) --p;
        if(!p) break;
        ll v=floor((mid-max(0ll,a[p].l-6)/5.25)/0.89);
        // cerr << mid << ' ' << p << ' ' << v << endl;
        if(v<=0) return 0;
        ll w=v*24;
        cnt+=b[p]/w;
        b[p]%=w;
        if(!b[p]) continue;
        ++cnt;
        v-=(b[p]+23)/24;
        b[p]=0;
        --p;
        while(p) {
            if(v*24>=b[p]) {
                v-=(b[p]+23)/24;
                --p;
            } else {
                b[p]-=v*24;
                break;
            }
        }
    }
    return cnt<=m;
}
signed main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(9);
    // cout << 94/5.25+36*0.89 << endl;
    int T;
    cin >> T;
    while(T--) {
        cin >> n >> m;
        FOR(i,1,n) cin >> a[i].l >> a[i].r >> a[i].h >> a[i].s;
        // cerr << check(33) << endl;
        db L=0,R=1e15;
        FOR(_,1,100) {
            db mid=(L+R)/2;
            if(check(mid)) R=mid;
            else L=mid;
        }
        cout << R << '\n';
    }
    return 0;
}