#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) for(int i = 0; i < n; i += 1)


const ll inf = 1e18;
mt19937 rnd(234);


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int t;
    cin >> t;
    for (int itr = 0; itr < t; itr += 1) {
        int n;
        ll m;
        cin >> n >> m;
        vector<ll> l(n), r(n), h(n), s(n);
        rep(i, n) cin >> l[i] >> r[i] >> h[i] >> s[i];
        auto check = [&](const flt total_time) {
            ll cur_banshees = m;
            ll free_hits = 0;
            for (int i = n - 1; i >= 0; i -= 1) {
                flt dtime = max(0.0, (l[i] - 6) / 5.25);
                if (dtime > total_time) {
                    return false;
                }
                ll hp = h[i] + s[i];
                ll dhits = min(free_hits, (hp + 23) / 24);
                free_hits -= dhits;
                hp = max(0ll, hp - dhits * 24);
                ll one_banshee_hits = floor((total_time - dtime) / 0.89);
                if (one_banshee_hits == 0) {
                    return false;
                }
                ll needed_hits = (hp + 23) / 24;
                ll needed_bunshees = (needed_hits + one_banshee_hits - 1) / one_banshee_hits;
                if (needed_bunshees > cur_banshees) {
                    return false;
                }
                cur_banshees -= needed_bunshees;
                free_hits += one_banshee_hits * needed_bunshees - needed_hits;
            }
            return true;
            };
        flt tl = 0;
        flt tr = 1e13;
        rep(i, 200) {
            flt tm = (tl + tr) / 2;
            if (check(tm)) {
                tr = tm;
            } else {
                tl = tm;
            }
        }
        cout << fixed << setprecision(10) << tr << "\n";
    }
    return 0;
}