#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

int main() {
    int N, K;
    cin >> N >> K;

    vector<int> P(N), s(N), t(N);
    rep(i, N) cin >> P[i] >> s[i] >> t[i];

    int ss = accumulate(all(s), 0);
    int tt = accumulate(all(t), 0);
    if (tt > 60) {
        cout << "-1\n";
        return 0;
    }

    cout << (ss <= 60 ? 1 : K + 2) << ' ';

    vector<int> pw(N + 1, 1);
    rep(i, N) pw[i + 1] = pw[i] * 6;

    auto to_v = [&](int x) {
        vector<int> v(6);
        rep(i, 6) {
            v[i] = x % 6;
            x /= 6;
        }
        return v;
    };

    auto to_i = [&](vector<int> v) {
        int x = 0;
        per(i, 6) {
            x *= 6;
            x += v[i];
        }
        return x;
    };

    vector<int> dp(pw[N], -inf);
    dp[0] = 0;

    rep(i, pw[N]) {
        if (dp[i] == -inf) continue;
        auto v = to_v(i);
        rep(j, 1 << N) {
            if (j == 0) continue;
            int sum = 0;
            bool flag = true;
            rep(k, N) {
                sum += (flg(j, k) ? s[k] : t[k]);
                if (v[k] >= P[k] && flg(j, k) == 1) flag = false;
                if (v[k] <= K && flg(j, k) == 0) flag = false;
            }
            if (sum <= 60 || !flag) continue;
            int ni = i;
            rep(k, N) {
                if (flg(j, k)) ni += pw[k];
            }
            chmax(dp[ni], dp[i] + 1);
        }
    }

    cout << *max_element(all(dp)) + 1 << ' ';

    using ld = long double;

    vector<ld> E(pw[N], 0.0);
    per(i, pw[N]) {
        auto v = to_v(i);
        int cnt = 0;
        rep(j, 1 << N) {
            int sum = 0, tmp = 1;
            bool flag = true;
            rep(k, N) {
                sum += (flg(j, k) ? s[k] : t[k]);
                if (v[k] >= P[k] && flg(j, k) == 1) flag = false;
                if (v[k] <= K && flg(j, k) == 0) flag = false;
                if (flg(j, k)) {
                    tmp *= P[k] - v[k];
                } else {
                    tmp *= v[k] - K;
                }
            }
            if (!flag) continue;
            cnt += tmp;
            if (sum > 60) {
                int ni = i;
                rep(k, N) {
                    if (flg(j, k)) ni += pw[k];
                }
                E[i] += E[ni] * tmp;
            }
        }
        if (cnt > 0) E[i] = E[i] / double(cnt) + 1.0;
    }

    cout << E[0] << '\n';
}