#include <bits/stdc++.h>

using i64 = long long;

constexpr double eps = 1E-5;
constexpr int range = 6;
constexpr int damage = 12 * 2;
constexpr double speed = 5.25;
constexpr double cooldown = 0.89;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<i64> p(n);
    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        i64 l, r;
        int h, s;
        std::cin >> l >> r >> h >> s;
        l = std::max(0LL, l - range);
        h = (h + s + damage - 1) / damage;
        p[i] = l;
        a[i] = h;
    }

    auto check = [&](double t) {
        i64 attack = 0;
        i64 need = 0;
        for (int i = n - 1; i >= 0; i--) {
            i64 times = std::floor((t - p[i] / speed) / cooldown);
            if (times < 1) {
                return false;
            }
            i64 v = std::min(attack, i64(a[i]));
            attack -= v;
            i64 more = (a[i] - v + times - 1) / times;
            need += more;
            if (need > m) {
                return false;
            }
            attack += more * times - (a[i] - v);
        }
        return true;
    };

    double lo = 0;
    double hi = 1E12;
    while (hi - lo > std::max(1.0, lo) * eps) {
        double x = (lo + hi) / 2;
        if (check(x)) {
            hi = x;
        } else {
            lo = x;
        }
    }

    std::cout << lo << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }

    return 0;
}