#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <time.h>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>

using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// to erase in multiset-> less_equal<T> and 
// s.erase(s.find_by_order(s.order_of_key(x)))
// lower_bound(x)=>(cannot use the stl lower_bound function)
// ll idx = s.order_of_key(x)
// if(idx == s.size()) -> no lower_bound
// else lb = *s.find_by_order(idx) // as 0-indexing
// idx-1 will give highest value which is strictly less than x
// for upper_bound->do the same with (x+1)

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef tuple<ll, ll, ll> t64;
typedef vector<t64> vt64;
typedef vector<vt64> vvt64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef vector<vector<p32> > vvp32;
typedef vector<bool> vb;
ll mod =  1e9+7, MOD = 998244353;
double eps = 1e-12;
// #define forn(i,e) for(ll i = 0; i < e; i++)
#define FOR(s, e, i) for(int i = s; i <= e; i++)
// #define rforn(i,s) for(ll i = s; i >= 0; i--)
#define ROF(s ,e, i) for(int i = s; i >= e; i--)
#define coutAll(A) for(auto asdafas : A) cout <<  asdafas << " "; cout << "\n";
#define foutAll(A) for(auto asdafas : A) fout <<  asdafas << " "; cout << "\n";
#define cinAll(A) for(auto &asdafas : A) cin >>  asdafas;
#define finAll(A) for(auto &asdafas : A) fin >>  asdafas;
#define minpq priority_queue<ll, v64, greater<ll>>
#define maxpq priority_queue<ll> 
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
ll inf = LLONG_MAX;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> pii;
//#define MAXN 1000000
template<class T>
struct Point {
    typedef Point P;
    T x, y;
    Point(T x=0, T y=0) : x(x), y(y) {}
    P operator+(P p) const { return P(x+p.x, y+p.y); }
    P operator-(P p) const { return P(x-p.x, y-p.y); }
    P operator*(T d) const { return P(x*d, y*d); }
    P operator/(T d) const { return P(x/d, y/d); }
    T cross(P p) const { return x*p.y-y*p.x; }
    T cross(P a, P b) const { return (a-*this).cross(b-*this); }
};

template<class P>
pair<int, P> lineInter(P s1, P e1, P s2, P e2) {
    auto d = (e1 - s1).cross(e2 - s2);
    if (d == 0)
        return {0, P(0,0)};
    auto p = s2.cross(e1, e2), q = s2.cross(e2, s1);
    return {1, (s1*p+e1*q)/d};
}

typedef Point<long double> P;
vector<P> polygonCut(const vector<P> poly, P s, P e) {
    vector<P> res;
    FOR(0,sz(poly)-1, i) {
        P cur = poly[i], prev = i ? poly[i-1] : poly.back();
        bool side = s.cross(e, cur) < 0;
        if (side != (s.cross(e, prev) < 0))
            res.pb(lineInter(s, e, cur, prev).second);
        if (side)
            res.pb(cur);
    }
    return res;
}

long double polygonArea(vector<P> v) {
    long double a = v.back().cross(v[0]);
    FOR(0,sz(v)-2, i) a += v[i].cross(v[i+1]);
    return abs(a)/2;
}
void solve(int it)
{
    int n;
    ld m;
    cin >> n >> m;
    if(n > 2){
        int x;
        FOR(0, n -1, i) cin >> x >> x >> x;
        cout << "100.000000%\n";
        return;
    }
    vector<vector<P>>A = {{P(0, 0), P(0, m), P(m, m), P(m, 0)}};
    FOR(0, n - 1, i){
        ld a, b, c;
        cin >> a >> b >> c;
        P p1, p2;
        if(b){
            p1 = P(0, -c/b);
            p2 = P(1, -(c+a)/b);
        }else{
            p1 = P(-c/a, 0);
            p2 = P(-(c+b)/a, 1);
        }
        vector<vector<P>>nxt;
        for(auto poly : A){
            nxt.pb(polygonCut(poly, p1, p2));
            nxt.pb(polygonCut(poly, p2, p1));
        }
        A = nxt;        
    }
    ld res = m*m;
    for(auto poly : A){
        if(poly.empty()){
            res=  0;
        }else{
            res = min(res, polygonArea(poly));
        }
        // cout << res << "\n";
    }
    cout << fixed << setprecision(6) << 100*(m*m-res)/(m*m) << "%\n";

}


int main()
{
    fast_cin();    
    ll t = 1;
    cin >> t;
    for(int it=1; it<=t; it++)
    {
        //cout << "Case " << it << ": ";
        solve(it);
    }
    return 0;
}