#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
double A[12],B[12],P[12];
double dp[1<<12][41];

double hoge(int mask,int M) {
	if(mask==0) return 0;
	if(M<0) return -1e9;
	if(dp[mask][M]>=0) return dp[mask][M];
	
	double ret=0;
	int i;
	FOR(i,N) if(mask&(1<<i)) {
		double ac=hoge(mask^(1<<i),M);
		double wa=hoge(mask,M-1);
		
		ret=max(ret,A[i]+ac);
		if(wa>=0) ret=max(ret,P[i]*(B[i]+ac)+(1-P[i])*wa);
	}
	
	return dp[mask][M]=ret;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,N) {
		cin>>A[i]>>B[i]>>P[i];
		A[i]=1/A[i];
		B[i]=1/B[i];
		P[i]=1/P[i];
	}
	
	int mask;
	FOR(mask,1<<N) FOR(i,M+1) dp[mask][i]=-2;
	
	_P("%.12lf\n",hoge((1<<N)-1,M));
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}