// clang-format off
#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <climits>

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b)-1; i >= (a); i--)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep(i, n) for(int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T>& p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T>& vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
typedef long long ll;

#define MAX 10000

int N;
int P;

ll a[MAX][4];
ll m[2][3*MAX+1];

int main()
{
    constexpr ll INF = LLONG_MAX;
    cin >> N >> P;
    rep(i, N){
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        a[i][3] = 1;
    }
    rep(j, P+1){
        m[0][j] = INF;
        m[1][j] = INF;
    }

    rep(i, P+1){
        if(i < 4){
            m[0][i]=a[0][i];            
        } else {
            m[0][i] = 0;
        }
    }
    for(int i = 1; i < N; i++){
        rep(j, P+1){
            ll min_ = INF;
            for(int s = 0; s <= 3 and j - s >= 0; s++){
                chmin(min_, m[0][j-s]+a[i][s]);
            }
            m[1][j] = min_;
        }
        rep(j, P+1){
            m[0][j] = m[1][j];
            m[1][j] = INF;
        }
    }
    cout << fixed << setprecision(10) << (long double)(m[0][P]) / N << endl;
    
    return 0;
}