from collections import defaultdict
n,k = map(int,input().split())
p = [0] * n
s = [0] * n
t = [0] * n
for i in range(n):
	p[i], s[i], t[i] = map(int,input().split())

if sum(t) > 60:
	print(-1)
	exit()

g = defaultdict(lambda:-1)
minans = 9999999999999
maxans = 0

def dfs(date, used, unused):
	global minans, maxans, k
	targ = (date << 50) + (used << 25) + unused
	if g[targ] >= 0:
		return g[targ]
	l = 1
	ul = [0] * n
	unl = [0] * n
	if date >= k+2:
		for i in range(n):
			used += 6 ** i
	rrr = 1
	for i in range(n):
		ul[i] += (used // rrr) % 6
		unl[i] += (unused // rrr) % 6
		rrr *= 6
	#print(ul, unl)
	ret = 0
	for i in range(1 << n):
		l = 1
		nused = used
		nunused = unused
		mode = 1
		T = 0
		for j in range(n):
			if i >> j & 1:
				if ul[j] == 0:
					mode = 0
					break
				l *= ul[j] / (ul[j] + unl[j])
				T += t[j]
				nused -= 6 ** j
			else:
				if unl[j] == 0:
					mode = 0
					break
				l *= unl[j] / (ul[j] + unl[j])
				T += s[j]
				nunused -= 6 ** j
		if mode:
			if T <= 60:
				ret += l * date
				minans = min(date, minans)
				maxans = max(date, maxans)
			else:
				ret += l * dfs(date + 1, nused, nunused)
	g[targ] = ret
	return ret

start = 0
for i in range(n):
	start += p[i] * 6 ** i

r = dfs(1, 0, start)
print(minans, maxans, r)