#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M;
    cin >> N >> M;
    vector<double> A(N), B(N);
    vector<int> P(N);
    for (int i = 0; i < N; i++) {
        int a, b;
        cin >> a >> b >> P[i];
        A[i] = ((long double)1) / a;
        B[i] = ((long double)1) / b;
    }

    vector dp(M + 1, vector<long double>(1 << N, 0));
    for (int i = M; i >= 0; i--) {
        for (int mask = (1 << N) - 1; mask >= 0; mask--) {
            long double& val = dp[i][mask];
            for (int j = 0; j < N; j++) {
                if (~mask >> j & 1) {
                    val += A[j];
                }
            }
            if (i == M) continue;
            for (int j = 0; j < N; j++) {
                if (mask >> j & 1) continue;
                long double sum = dp[i + 1][mask] * (P[j] - 1) / P[j] + (dp[i][mask | 1 << j] + B[j]) / P[j];
                chmax(val, sum);
            }
        }
    }

    long double ans = dp[0][0];
    cout << ans << '\n';
    return 0;
}