#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
map<vector<int>, tuple<int, int, double>>mp;//出題済み
int n, k;
vector<int>p, s, t;
tuple<int, int, double> dp(vector<int> v) {
	if (mp.count(v))return mp[v];
	int mn = INF;
	int mx = -1;
	double val = 0.0;
	int w = 1;
	vector<int>a(n), b(n);
	rep(i, n) {
		int x = min(k, v[i]);
		a[i] = v[i] - x;
		b[i] = p[i] - v[i];
		w *= a[i] + b[i];
	}
	rep(i, 1 << n) {
		int subw = 1;
		int sum = 0;
		auto nv = v;
		rep(j, n) {
			if (1 & (i >> j)) {
				// 出題済みからの出題
				subw *= a[j];
				sum += t[j];
			}
			else {
				// 未出題からの出題
				subw *= b[j];
				nv[j]++;
				sum += s[j];
			}
		}
		if (0 == subw)continue;
		tuple<int, int, double>now;
		if (sum <= 60) {
			now = make_tuple(1, 1, (double)subw / w);
		}
		else {
			now = dp(nv);
			get<0>(now)++;
			get<1>(now)++;
			get<2>(now) = (get<2>(now) + 1)*(double)subw / w;
		}
		chmin(mn, get<0>(now));
		chmax(mx, get<1>(now));
		val += get<2>(now);
	}
	mp[v] = make_tuple(mn, mx, val);
	return mp[v];
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> k;
	p.resize(n);
	s.resize(n);
	t.resize(n);
	rep(i, n) cin >> p[i] >> s[i] >> t[i];
	int sumt = 0;
	rep(i, n)sumt += t[i];
	if (sumt > 60) {
		cout << -1 << endl;
		return 0;
	}
	auto ret = dp(vector<int>(n, 0));
	cout << get<0>(ret) << " " << get<1>(ret) << " " << fixed << setprecision(16) << get<2>(ret) << endl;
	return 0;
}