#include<bits/stdc++.h>
using namespace std;
using ll = long long;
// #define endl '\n'
const ll MOD = 998244353;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(12);

    int n, k;
    cin >> n >> k;
    int stot = 0, ttot = 0;
    vector<int> P(n), S(n), T(n);
    for(int i = 0; i < n; i++){
        cin >> P[i] >> S[i] >> T[i];
        stot += S[i];
        ttot += T[i];
    }
    if(stot <= 60){
        cout << "1 1 1" << endl;
        return 0;
    }
    else if(ttot > 60){
        cout << -1 << endl;
        return 0;
    }

    auto f=[&](vector<int> A){
        int ret = 0;
        for(auto a:A) ret = ret * 6 + a;
        return ret;
    };

    auto g=[&](int x){
        vector<int> ret(n);
        for(int i = n - 1; i >= 0; i--){
            ret[i] = x % 6;
            x /= 6;
        }
        return ret;
    };

    int mi = 1 << 30;
    int ma = 0;
    long double ave = 0;
    map<int, long double> PP;
    vector<int> V(n, k);
    PP[f(V)] = 1.0;

    int day = k + 1;
    while(!PP.empty()){
        map<int, long double> NP;
        for(auto tmp:PP){
            auto A = g(tmp.first);
            long double p = tmp.second;

            for(auto bit = 0; bit < (1 << n); bit++){
                long double pp = p;
                int time = 0;
                for(int i = 0; i < n; i++){
                    if(bit >> i & 1){
                        time += T[i];
                        pp *= (long double)(A[i] - k) / (long double)(P[i] - k);
                    }
                    else{
                        time += S[i];
                        pp *= (long double)(P[i] - k - (A[i] - k)) / (long double)(P[i] - k);
                        A[i]++;
                    }
                }
                if(pp != 0){
                    if(time <= 60){
                        mi = min(mi, day);
                        ave += (long double) day * pp;
                    }
                    else NP[f(A)] += pp;
                }

                for(int i = 0; i < n; i++){
                    if(!(bit >> i & 1)) A[i]--;
                }
            }
        }
        PP.swap(NP);
        ma = max(ma, day);
        day++;
    }
    cout << mi << " " << ma << " " << ave << endl;
    return 0;
}