n, k = map(int, input().split())
p = []
s = []
t = []
for _ in range(n):
    pi, si, ti = map(int, input().split())
    p.append(pi)
    s.append(si)
    t.append(ti)
prodp = [1]
for i in range(n):
    prodp.append(prodp[-1] * (p[i] + 1))
def idx_encode(data):
    idx = 0
    for i in range(n):
        idx *= p[i] + 1
        idx += data[i]
    return idx
def idx_decode(idx):
    data = []
    for i in range(n - 1, -1, -1):
        data.append(idx % (p[i] + 1))
        idx //= p[i] + 1
    data.reverse()
    return data
winable = False
win = [False] * (1 << n)
for i in range(1 << n):
    tmp = 0
    for j in range(n):
        if i >> j & 1:
            tmp += t[j]
        else:
            tmp += s[j]
    if tmp <= 60:
        win[i] = True
        winable = True
if not winable:
    print(-1)
    exit()
mx = [0] * prodp[n]
mn = [10**9] * prodp[n]
ex = [0.] * prodp[n]
for i in range(prodp[n]-1, -1, -1):
    data = idx_decode(i)
    numcases = 0
    numselfcases = 0
    sumsteps = 0.
    for j in range(1 << n):
        cases = 1
        ndata = data.copy()
        for l in range(n):
            if j >> l & 1:
                cases *= max(0, data[l] - k)
            else:
                cases *= p[l] - data[l]
                ndata[l] += 1
        if cases == 0:
            continue
        ni = idx_encode(ndata)
        numcases += cases
        sumsteps += cases
        if win[j]:
            mn[i] = min(mn[i], 1)
            mx[i] = max(mx[i], 1)
        elif ni == i:
            numselfcases += cases
        else:
            sumsteps += cases * ex[ni]
            mn[i] = min(mn[i], mn[ni] + 1)
            mx[i] = max(mx[i], mx[ni] + 1)
    ex[i] = sumsteps / (numcases - numselfcases)
print(mn[0], mx[0], ex[0])