#include<iostream>
#include<vector>
#include<map>
#include<tuple>
#include<iomanip>
using namespace std;
int N,K;
int P[6],s[6],t[6];
map<vector<int>,tuple<int,int,double> >memo;
tuple<int,int,double>f(vector<int>A)
{
	if(memo.find(A)!=memo.end())return memo[A];
	int mn=1e9,mx=-1;
	double p=0;
	int a[6],b[6];
	int W=1;
	for(int i=0;i<N;i++)
	{
		int k=min(K,A[i]);
		a[i]=A[i]-k,b[i]=P[i]-A[i];
		W*=a[i]+b[i];
	}
	for(int i=0;i<1<<N;i++)
	{
		int w=1,sum=0;
		vector<int>B=A;
		for(int j=0;j<N;j++)
		{
			if(i>>j&1)
			{
				w*=a[j];
				sum+=t[j];
			}
			else
			{
				w*=b[j];
				B[j]++;
				sum+=s[j];
			}
		}
		if(w==0)continue;
		tuple<int,int,double>now;
		if(sum<=60)now=make_tuple(1,1,(double)w/W);
		else
		{
			now=f(B);
			get<0>(now)++;
			get<1>(now)++;
			get<2>(now)=(get<2>(now)+1)*(double)w/W;
		}
		mn=min(mn,get<0>(now));
		mx=max(mx,get<1>(now));
		p+=get<2>(now);
	}
	return memo[A]=make_tuple(mn,mx,p);
}
int main()
{
	cin>>N>>K;
	int st=0;
	for(int i=0;i<N;i++)
	{
		cin>>P[i]>>s[i]>>t[i];
		st+=t[i];
	}
	if(st>60)
	{
		cout<<-1<<endl;
		return 0;
	}
	tuple<int,int,double>ret=f(vector<int>(N,0));
	cout<<get<0>(ret)<<" "<<get<1>(ret)<<" "<<fixed<<setprecision(16)<<get<2>(ret)<<endl;
}