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]*S]+[[D+1]*S for s in R(p)]
for s in R(1,p):
	t=s
	while t:
		d=t&-t;i,u,t=v[d],s^d,t^d
		for b in R(S):
			r=max(0,b-A[i])+B[i]
			if r<S:o[s][r]=min(o[s][r],max(r,o[u][b]-A[i])+C[i])
print("YNeos"[sum(A)+min(o[p-1])>D::2])