#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, P;
  cin >> N >> P;

  int A[N];
  int B[N];
  int C[N];

  for (int i = 0; i < N; ++i) {
    cin >> A[i] >> B[i] >> C[i];
  }

  vector<int> dp(P + 1, INT_MAX);
  dp[0] = 0;

  for (int i = 1; i <= N; ++i) {
    int a = A[i - 1];
    int b = B[i - 1];
    int c = C[i - 1];
    vector<int> temp(P + 1, INT_MAX);

    for (int p = 0; p <= P; ++p) {
      if (dp[p] != INT_MAX) {
        temp[p] = min(temp[p], dp[p] + a);
        if (p + 1 <= P) {
          temp[p + 1] = min(temp[p + 1], dp[p] + b);
        }
        if (p + 2 <= P) {
          temp[p + 2] = min(temp[p + 2], dp[p] + c);
        }
        if (p + 3 <= P) {
          temp[p + 3] = min(temp[p + 3], dp[p] + 1);
        }
      }
    }

    dp = temp;
  }

  cout << fixed << setprecision(10) << dp[P] * 1.0 / N << endl;

  return 0;
}