#include using namespace std; #define F first #define S second #define pi M_PI #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; double dp[2][15001]; void Main() { int n,m; cin >> n >> m; rep(i,2)rep(j,m+1) dp[i][j]=MAXL; dp[0][0]=0; rep(i,n) { double x,y,z; cin >> x >> y >> z; rep(j,m+1) { dp[1][j]=min(dp[1][j],dp[0][j]+x); if(j+1<=m) dp[1][j+1]=min(dp[1][j+1],dp[0][j]+y); if(j+2<=m) dp[1][j+2]=min(dp[1][j+2],dp[0][j]+z); if(j+3<=m) dp[1][j+3]=min(dp[1][j+3],dp[0][j]+1); } rep(j,m+1) { dp[0][j]=dp[1][j]; dp[1][j]=MAXL; } } pd(dp[0][m]/n); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}