#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cout << fixed << setprecision(6);

    int t = 1;
    cin >> t;
    while(t-->0)
    {
        int n, m;
        cin >> n >> m;

        vector<ll> l(n), hp(n);
        for(int i=0; i<n; i++)
        {
            cin >> l[i] >> hp[i];
            l[i] = max((ll) 0, l[i]-6);

            ll h, s;
            cin >> h >> s;
            hp[i] = (h + s + 23)/24;
        }

        double L = l[n-1]/5.25 + 0.89, R = pow(10, 12);
        while(R-L>0.0001)
        {
            double T = (L+R)/2;
            double T_now = 0, T_last = 0;
            ll use = 1;

            for(int i=0; i<n; i++)
            {
                ll hp_left = hp[i];
                T_now = l[i]/5.25;
                //cout << T_now << " " << T_last << " " << floor((T-T_last)/0.89) << "\n";
                if(i!=0) T_last += (l[i]-l[i-1])/5.25;
                else T_last = T_now;

                if(T_last >= T)
                {
                    use++;
                    T_last = T_now;
                }

                if(floor((T-T_last)/0.89) >= hp_left)
                {
                    T_last += hp_left*0.89;
                }
                else
                {
                    hp_left -= floor((T-T_last)/0.89);
                    use++;

                    //cout << "!! " << floor((T-T_now)/0.89) << "\n";
                    use += hp_left/(ll) floor((T-T_now)/0.89);
                    hp_left %= (ll) floor((T-T_now)/0.89);

                    T_last = T_now + hp_left * 0.89;
                }

                //cout << "! " << i << " " << hp[i] << " " << use << "\n";
            }

            if(T_last-T_now<0.01) use--;
            //cout << L << " " << R << " " << T << " " << use << "\n\n";

            if(use>m) L = T;
            else R = T;
        }

        cout << L << "\n";
    }
}
/*
2
2 1
1 2 1 100
100 500 736 0

3 2
0 1 12 0
1 2 6 6
2 3 3 10
*/