#include <bits/stdc++.h>
using namespace std;
int main(){
  cout << fixed << setprecision(10);
  int N, K;
  cin >> N >> K;
  vector<int> P(N), s(N), t(N);
  for (int i = 0; i < N; i++){
    cin >> P[i] >> s[i] >> t[i];
  }
  int ss = 0, st = 0;
  for (int i = 0; i < N; i++){
    ss += s[i];
    st += t[i];
  }
  if (st > 60){
    cout << -1 << endl;
  } else if (ss <= 60){
    cout << 1 << ' ' << 1 << ' ' << 1 << endl;
  } else {
    int mn = K + 2, mx = K + 2;
    for (int i = 0; i < N; i++){
      mx += P[i] - (K + 1);
    }
    vector<int> pr(N + 1);
    pr[0] = 1;
    for (int i = 0; i < N; i++){
      pr[i + 1] = pr[i] * (P[i] + 1);
    }
    vector<double> dp(pr[N], 0);
    for (int i = pr[N] - 1; i >= 0; i--){
      int x = i;
      vector<int> A(N);
      for (int j = 0; j < N; j++){
        A[j] = x % (P[j] + 1);
        x /= P[j] + 1;
      }
      for (int j = 0; j < (1 << N); j++){
        int sum = 0;
        int i2 = 0;
        double p = 1;
        for (int k = 0; k < N; k++){
          if ((j >> k & 1) == 0){
            if (A[k] <= K){
              p = 0;
              break;
            } else {
              sum += t[k];
              i2 += A[k] * pr[k];
              p *= A[k] - K;
              p /= P[k] - K;
            }
          }
          if ((j >> k & 1) == 1){
            if (A[k] == P[k]){
              p = 0;
              break;
            } else {
              sum += s[k];
              i2 += (A[k] + 1) * pr[k];
              p *= P[k] - max(A[k], K);
              p /= P[k] - K;
            }
          }
        }
        if (p != 0){
          if (sum <= 60){
            dp[i] += p;
          } else {
            dp[i] += (dp[i2] + 1) * p;
          }
        }
      }
    }
    cout << mn << ' ' << mx << ' ' << dp[0] << endl;
  }
}