/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, p;
    cin >> n >> p;
    //  vector<vector<int>> dp(n + 1, vector<int>(p + 1, 2e9));
    V dp(p + 1, 1e18);
    // dp[0][p] = 0;
    dp[p] = 0;
    vector<vector<int>> vec(n, vector<int>(3));
    rep(i, n) rep(j, 3) cin >> vec[i][j];
    rep(i, n)
    {
        V dp2(p + 1, 1e18);
        rep(j, p + 1)
        {
            if (j >= 3)
            {
              //  chmin(dp[i + 1][j - 3], dp[i][j] + 1);
               chmin(dp2[j - 3], dp[j] + 1);
            }
            if (j >= 2)
            {
               // chmin(dp[i + 1][j - 2], dp[i][j] + vec[i][2]);
              chmin(dp2[j - 2], dp[j] + vec[i][2]);
            }
            if (j >= 1)
            {
               // chmin(dp[i + 1][j - 1], dp[i][j] + vec[i][1]);
               chmin(dp2[j - 1], dp[j] + vec[i][1]);
            }
           // chmin(dp[i + 1][j], dp[i][j] + vec[i][0]);
            chmin(dp2[j], dp[j] + vec[i][0]);
        }
        rep(j,p+1){
            dp[j] = dp2[j];
        }
    }
    

    cout << setprecision(10) << (ld)dp[0] / n << endl;
}