#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector<int> a(n), b(n), p(n); REP(i, n) cin >> a[i] >> b[i] >> p[i];
  vector dp(1 << n, vector(m + 1, 0.));
  for (int i = (1 << n) - 2; i >= 0; --i) REP(j, m + 1) {
    REP(k, n) {
      if (i >> k & 1) continue;
      chmax(dp[i][j], dp[i | (1 << k)][j] + 1. / a[k]);
      if (j > 0) chmax(dp[i][j], (dp[i | (1 << k)][j] + 1. / b[k]) / p[k] + dp[i][j - 1] * (p[k] - 1) / p[k]);
    }
  }
  cout << *ranges::max_element(dp[0]) << '\n';
  return 0;
}