#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

struct point {
    double x, y;
};

point operator-(point a, point b) {
    return {a.x - b.x, a.y - b.y};
}
double operator/(point a, point b) {
    return a.x * b.y - a.y * b.x;
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    int t; cin >> t;
    while (t--) {
        int n, m; cin >> n >> m;
        vector<array<int, 3>> p(n);
        for (auto &[x, y, z] : p) cin >> x >> y >> z;

        if (n >= 3) {
            cout << "100.000000%\n";
            continue;
        }
        else {
            vector<pair<point, int>> pt;
            pt.push_back({point{0, 0}, 0});
            pt.push_back({point{(double)m, 0}, 0});
            pt.push_back({point{(double)m, (double)m}, 0});
            pt.push_back({point{0, (double)m}, 0});

            bool flag = false;
            for (int i = 0; i < p.size(); i++) {
                auto [a, b, c] = p[i];

                double x;
                double y;

                int cnt = 0;
                if (b != 0) {
                    x = 0; y = -c / (double)b;
                    if (0 <= y && y <= m) pt.push_back({point{x, y}, i + 1}), ++cnt;

                    x = m; y = (-c - a * m) / (double)b;
                    if (0 <= y && y <= m) pt.push_back({point{x, y}, i + 1}), ++cnt;
                }
                if (a != 0) {
                    y = 0; x = -c / (double)a;
                    if (0 < x && x < m) pt.push_back({point{x, y}, i + 1}), ++cnt;

                    y = m; x = (-c - b * m) / (double)a;
                    if (0 < x && x < m) pt.push_back({point{x, y}, i + 1}), ++cnt;
                }
                if (cnt != 2) {
                    flag = true;
                    cout << "100.000000%\n";
                    break;
                }
            }
            if (flag) continue;

            auto f = [&](double x, double y) {
                if (y == 0) return x;
                else if (x == m) return m + y;
                else if (y == m) return 3 * m - x;
                else return 4 * m - y;
            };

            if (n == 2) {
                auto [a1, b1, c1] = p[0];
                auto [a2, b2, c2] = p[1];

                if (a1 * b2 - a2 * b1 == 0) {
                    cout << "100.000000%\n";
                    continue;
                }
                double x = (c2 * b1 - c1 * b2) / (double)(a1 * b2 - b1 * a2);
                double y = (c2 * a1 - c1 * a2) / (double)(b1 * a2 - a1 * b2);

                if (!(0 < x && x < m && 0 < y && y < m)) {
                    cout << "100.000000%\n";
                    continue;
                }

                sort(pt.begin(), pt.end(), [&](auto p, auto q) {
                    return f(p.first.x, p.first.y) < f(q.first.x, q.first.y);
                });

                point origin = {x, y};

                // for (int i = 0; i < 8; i++) {
                //     auto [x, y] = pt[i].first;
                //     cout << x << ' '<< y << endl;
                // }
                // cout << origin.x << ' ' << origin.y << '\n';

                double ans = 1e9;
                for (int i = 0; i < 8; i++) {
                    if (pt[i].second == 0) continue;

                    double area = 0;
                    for (int j = 0; j < 8; j++) {
                        point s = pt[(i + j) % 8].first;
                        point t = pt[(i + j + 1) % 8].first;

                        area += (s - origin) / (t - origin) * 0.5;
                        if (pt[(i + j + 1) % 8].second != 0) break;
                    }
                    ans = min(ans, area);
                }
                ans = (double)m * m - ans;
                ans /= (double)m * m;
                ans = ans * 100;

                cout.precision(6);
                cout << fixed << ans << "%\n";
            }
            else {
                sort(pt.begin(), pt.end(), [&](auto p, auto q) {
                    return f(p.first.x, p.first.y) < f(q.first.x, q.first.y);
                });

                double ans = 1e9;
                for (int i = 0; i < 6; i++) {
                    if (pt[i].second == 0) continue;

                    point origin = pt[i].first;
                    double area = 0;
                    for (int j = 1; j < 6; j++) {
                        point s = pt[(i + j) % 6].first;
                        point t = pt[(i + j + 1) % 6].first;

                        area += (s - origin) / (t - origin) * 0.5;
                        if (pt[(i + j + 1) % 6].second != 0) break;
                    }
                    ans = min(ans, area);
                }
                ans = (double)m * m -ans;
                ans /= (double)m * m;
                ans = ans * 100;

                cout.precision(6);
                cout << fixed << ans << "%\n";
            }
        }
    }
}