#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}


ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}



using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
using vvvvm = vector<vvvm>;
using vvvvvm = vector<vvvvm>;
using vvvvvvm = vector<vvvvvm>;

vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}

vvd DP;
vvb seen;
ll N, M;
vd A, B, P;
double dfs(ll m, ll S) {
    if (m == M + 1) {
        return -1e10;
    }
    if (S == (1 << N) - 1) {
        return 0;
    }
    else {
        if (seen[m][S]) {
            return DP[m][S];
        }
        double res = -1e10;
        rep(i, N) {
            if (S & (1 << i))continue;

            chmax(res, dfs(m, S + (1 << i)) + 1.0 / A[i]);
            double p = 1.0 / P[i] * (dfs(m, S + (1 << i)) + 1.0 / B[i]);
            p += (1.0 - (1.0 / P[i])) * dfs(m + 1, S);
            chmax(res, p);
        }
        seen[m][S] = 1;
        DP[m][S] = res;
        return res;
    }
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N >> M;
    A.resize(N);
    B.resize(N);
    P.resize(N);
    rep(i, N)cin >> A[i] >> B[i] >> P[i];
    seen.assign(M + 1, vb(1 << N, 0));
    DP.assign(M + 1, vd(1 << N, 0));
    cout << fixed << setprecision(16) << dfs(0, 0) << endl;
}