import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const K = readInt;
      auto P = new int[N];
      auto S = new int[N];
      auto T = new int[N];
      foreach (i; 0 .. N) {
        P[i] = readInt;
        S[i] = readInt;
        T[i] = readInt;
      }
      
      const D = P.sum + 1;
      auto f = new bool[][](D + 1, 6^^N);
      auto g = new real[][](D + 1, 6^^N);
      foreach (d; 0 .. D + 1) {
        g[d][] = 0.0L;
      }
      {
        int p;
        foreach (i; 0 .. N) {
          p += P[i] * 6^^i;
        }
        f[0][p] = true;
        g[0][p] = 1.0L;
      }
      
      int mn = D, mx = -1;
      real avg = 0.0L;
      foreach (d; 0 .. D) {
        foreach (p; 0 .. 6^^N) if (f[d][p]) {
          auto xs = new int[N];
          foreach (i; 0 .. N) {
            xs[i] = p / 6^^i % 6;
          }
          foreach (q; 0 .. 1 << N) {
            bool ok = true;
            real prob = g[d][p];
            int cost;
            int pp = p;
            foreach (i; 0 .. N) {
              const cand = P[i] - min(K, d);
              assert(xs[i] <= cand);
              if (q >> i & 1) {
                // new
                ok = ok && (xs[i] >= 1);
                prob *= cast(real)(xs[i]) / cand;
                cost += S[i];
                pp -= 6^^i;
              } else {
                // used
                ok = ok && (xs[i] < cand);
                prob *= cast(real)(cand - xs[i]) / cand;
                cost += T[i];
              }
            }
            if (ok) {
              if (cost <= 60) {
                chmin(mn, d);
                chmax(mx, d);
                avg += prob * d;
              } else {
                f[d + 1][pp] = true;
                g[d + 1][pp] += prob;
              }
            }
          }
        }
      }
      
      if (mn <= mx) {
        writefln("%s %s %.12f", mn + 1, mx + 1, avg + 1.0L);
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}