#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <cmath>
/*
#include <map>
#include <functional>
#include <set>
#include <queue>
#include <cstdio>
*/
using namespace std;
typedef long long ll;
//typedef pair<ll, ll> P;

int N, P;
int a[5050], b[5050], c[5050];

// コンテストi までにj問題といたときの順位の合計
int dp[5050][15050];
const int INF = 1 << 30;
#define abc(i, j, k) ((j >= 0 && dp[i][j] < INF) ? (dp[i][j] + k) : (INF))

int main() {
   cin >> N >> P;
   for (int i=0;i<N;i++) {
      cin >> a[i] >> b[i] >> c[i];
   }
   for (int i=0;i<=N;i++) {
      for (int j=0;j<=N*3;j++) {
         dp[i][j] = INF;
      }
   }
   dp[0][0] = 0;
   for (int i=0;i<N;i++) {
      for (int j=0;j<=P;j++) {
         dp[i+1][j] = min({abc(i, j, a[i]),
                           abc(i, j-1, b[i]),
                           abc(i, j-2, c[i]),
                           abc(i, j-3, 1)});
      }
   }
   cout << dp[N][P] << endl;
   cout << (double)dp[N][P] / (double)N << endl;
}