#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
using namespace std;

int main(void)
{
    int n,m;
    cin >> n >> m;
    vector<int> a(n);
    vector<int> b(n);
    vector<int> p(n);
    for(int i=0;i<n;++i){
        cin >> a[i] >> b[i] >> p[i];
    }
    vector<vector<double>> dp_(1<<n,vector<double>(2));
    vector<int> memo(1<<n);
    for(int i=0;i<(1<<n);++i){
        for(int j=0;j<2;++j){
            for(int k=0;k<n;++k){
                if(j){
                    if((i>>k)&1){
                        if((dp_[i-(1<<k)][j]+1.0/b[k])/p[k]+dp_[i][j-1]*(1.0-1.0/p[k])>dp_[i][j]){
                            memo[i]=k;
                        }
                        dp_[i][j]=max((dp_[i-(1<<k)][j]+1.0/b[k])/p[k]+dp_[i][j-1]*(1.0-1.0/p[k]),dp_[i][j]);
                    }
                } else if((i>>k)&1){
                    dp_[i][j]=max(dp_[i-(1<<k)][j]+1.0/a[k],dp_[i][j]);
                }
            }
        }
    }
    vector<int> pos(n);
    for(int i=0;i<n;++i){
        pos[i]=i;
    }
    do {
        bool ok=true;
        int cur=0;
        for(int i=0;i<n;++i){
            cur|=(1<<pos[i]);
            if(memo[cur]!=pos[i]){
                ok=false;
                break;
            }
        }
        if(ok){
            break;
        }
    } while(next_permutation(pos.begin(),pos.end()));
    vector<vector<double>> dp(n+1,vector<double>(m+1));
    for(int i=0;i<n;++i){
        for(int j=0;j<=m;++j){
            dp[i+1][j]=max(dp[i][j]+1.0/a[pos[i]],dp[i+1][j]);
            if(j){
                dp[i+1][j]=max((dp[i][j]+1.0/b[pos[i]])/p[pos[i]]+dp[i+1][j-1]*(1.0-1.0/p[pos[i]]),dp[i+1][j]);
            }
        }
    }
    cout << setprecision(15) << dp[n][m] << endl;
    return 0;
}