#include <bits/stdc++.h>

using namespace std;

int n,d;
int a[13];
int b[13];
int c[13];
int dp[1<<13][3];

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

    cin >> n >> d;
    for(int i=0;i<n;i++)
    {
        cin >> a[i] >> b[i] >> c[i];
    }

    for(int i=0;i<(1<<n);i++)
    {
        for(int j=0;j<3;j++)
        {
            dp[i][j] = 1e9;
        }
    }

    dp[0][0] = 0;
    dp[0][1] = 0;
    dp[0][2] = 0;

    for(int i=0;i<(1<<n);i++)
    {
        for(int j=0;j<n;j++)
        {
            if((i&(1<<j))==0)
            {
                int ni = i + (1<<j);
                int A = dp[i][0] + a[j];
                int B = max(A,dp[i][1]) + b[j];
                int C = max(B,dp[i][2]) + c[j];
                if(dp[ni][0] > A)
                {
                    dp[ni][0] = A;
                    dp[ni][1] = B;
                    dp[ni][2] = C;
                }
                else if(dp[ni][0]==A && dp[ni][1] > B)
                {
                    dp[ni][0] = A;
                    dp[ni][1] = B;
                    dp[ni][2] = C;                    
                }
                else if(dp[ni][0]==A && dp[ni][1]==B && dp[ni][2] > C)
                {
                    dp[ni][0] = A;
                    dp[ni][1] = B;
                    dp[ni][2] = C;                    
                }
            }
        }
    }

    if(dp[(1<<n)-1][2] <= d)
    {
        cout << "Yes" << '\n';
    }
    else
    {
        cout << "No" << '\n';
    }

	return 0;
}