R=range
J=lambda:map(int,input().split())
N,D=J()
p=1<<N
A=[0]*N
B=A[:]
C=A[:]
v=[0]*p
for i in R(N):A[i],B[i],C[i]=J();v[1<<i]=i
S=sum(B)+1
o=[[(0,0)]]+[[]for s in R(p)]
for s in R(1,p):
	t,y=s,[]
	while t:
		d=t&-t;i,t=v[d],t^d
		for b,x in o[s^d]:r=max(0,b-A[i])+B[i];y+=[(r,max(r,x-A[i])+C[i])]
	for b,x in sorted(y):
		if not o[s] or o[s][-1][1]>x:o[s]+=[(b,x)]
print("YNeos"[sum(A)+min(x for b,x in o[p-1])>D::2])