#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    ll N, M, K;
    long double x, ans=0;
    cin >> N >> M;
    K = 1<<N;
    vector<long double> A(N), B(N), P(N);
    for (int i=0; i<N; i++){
        cin >> x;
        A[i] = 1.0l/x;
        cin >> x;
        B[i] = 1.0l/x;
        cin >> x;
        P[i] = 1.0l/x;
    }
    vector<vector<long double>> dp(K, vector<long double>(M+1));

    for (int i=K-1; i>=0; i--){
        for (int j=0; j<N; j++){
            if (i & (1<<j)) continue;
            dp[i][0] = max(dp[i][0], dp[i|(1<<j)][0]+A[j]);
            for (int k=1; k<=M; k++){
                dp[i][k] = max(dp[i][k], (dp[i|(1<<j)][k]+B[j]) * P[j] + dp[i][k-1] * (1.0l-P[j]));
            }
        }
    }

    for (int i=0; i<=M; i++){
        ans = max(ans, dp[0][i]);
    }

    cout << setprecision(18) << ans << endl;

    return 0;
}