#include <bits/stdc++.h>

#include <variant>

#define rep2(i, k, n) for (i64 i = (i64)(k); i < (i64)(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(x) begin(x), end(x)
#ifdef ENV_LOCAL
#define dump \
  if (1) cerr
#else
#define dump \
  if (0) cerr
#endif

using namespace std;
using namespace std::string_literals;

using i32 = int32_t;
using i64 = int64_t;
using f64 = double;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;

// using namespace harudake;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  i64 n, m;
  cin >> n >> m;
  vector<tuple<i64, i64, i64>> vt;
  rep(i, n) {
    i64 a, b, p;
    cin >> a >> b >> p;
    vt.emplace_back(a, b, p);
  }
  constexpr f64 INF = 1e18;
  vector dp(m + 1, vector<f64>(1 << n, -INF));
  rep(i, m + 1) { dp[i][0] = 0.; }
  rep(i, m + 1) rep(j, 1 << n) {
    rep(k, n) {
      if (((j >> k) & 1) == 0) continue;
      i64 jj = j ^ (1 << k);
      auto [a, b, p] = vt[k];
      if (i > 0) {
        f64 success = dp[i][jj] + 1. / b;
        f64 failed = dp[i - 1][j];
        f64 score = (success + (p - 1) * failed) / p;
        dp[i][j] = max(dp[i][j], score);
      }
      dp[i][j] = max(dp[i][j], dp[i][jj] + 1. / a);
    }
  }
  f64 ans = 0.;
  rep(i, m + 1) { ans = max(ans, dp[i].back()); }
  cout << fixed << setprecision(10) << ans << endl;
  return 0;
}