#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; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(n), b(n), p(n);
	rep(i, n)cin >> a[i] >> b[i] >> p[i];
	vector dp(1 << n, vector<double>(m + 1));
	rep(i, 1 << n)rep2(j, 1,m + 1) {
		rep(k, n) {
			if (!(1 & (i >> k)))continue;
			int ni = i - (1 << k);
			{
				double val = 1.0 / a[k] +dp[ni][j];
				chmax(dp[i][j], val);
			}
			{
				double val0 = 1.0 / b[k] + dp[ni][j];
				double val1 = dp[i][j - 1];
				double val = (1.0 / p[k])*val0 + (1. - 1. / p[k]) * val1;
				chmax(dp[i][j], val);
			}
		}
	}
	printf("%.16f\n", dp[(1 << n) - 1][m]);
	return 0;
}