#include using namespace std; /*{{{*/ //template #define rep(i,n) for(int i=0;i::max()/2; constexpr long long LINF = numeric_limits::max()/3; #define mp make_pair #define pb push_back #define eb emplace_back #define fi first #define se second #define all(v) (v).begin(),(v).end() #define sz(x) (int)(x).size() #define debug(x) cerr<<#x<<":"< ostream& operator<<(ostream& os,const vector& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; } template ostream& operator<<(ostream& os,const pair& p){ os << "(" << p.first << ","<< p.second <<")"; return os; } template ostream& operator<<(ostream& os,const set& st){ os<<"{"; for(T v:st) os< inline void chmax(T &x,U y){ if(y>x) x = y; } template inline void chmin(T &x,U y){ if(y pii; typedef vector vi; typedef vector vvi; ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); } //constexpr double eps = 1e-14; constexpr double eps = 1e-10; constexpr ll mod = 1e9+7; const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1}; /*}}}*/ constexpr ll max_n = 5000; int N,P; int r[max_n][4]; int main(){ cin >> N >> P; rep(i,N){ rep(j,3) cin >> r[i][j]; r[i][3] = 1; } vvi dp(2,vi(P+1,INF)); dp[0][0] = 0; for(int i=0;i update dp[i+1] for(int j=0;j<=P;j++){ for(int k=0;k<4;k++){ // k問解く int nj = j + k; if(nj > P) break; dp[1][nj] = min(dp[1][nj] , dp[0][j] + r[i][k]); } } dp[0] = dp[1]; for(int j=0;j<=P;j++) dp[1][j] = INF; } cout << Double(dp[0][P] / (double)N) << endl; }