#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];
    }


    vector <int> perm = {0,1,2};

    do
    {
        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];
                    int arr[3] = {A,B,C};

                    if(dp[ni][perm[0]] > arr[perm[0]])
                    {
                        dp[ni][0] = arr[0];
                        dp[ni][1] = arr[1];
                        dp[ni][2] = arr[2];
                    }
                    else if(dp[ni][perm[0]]==arr[perm[0]] && dp[ni][perm[1]] > arr[perm[1]])
                    {
                        dp[ni][0] = arr[0];
                        dp[ni][1] = arr[1];
                        dp[ni][2] = arr[2];                    
                    }
                    else if(dp[ni][perm[0]]==arr[perm[0]] && dp[ni][perm[1]]==arr[perm[1]] && dp[ni][perm[2]] > arr[perm[2]])
                    {
                        dp[ni][0] = arr[0];
                        dp[ni][1] = arr[1];
                        dp[ni][2] = arr[2];                    
                    }
                }
            }
        }

        if(max(dp[(1<<n)-1][0],max(dp[(1<<n)-1][1],dp[(1<<n)-1][2])) <= d)
        {
            cout << "Yes" << '\n';
            return 0;
        }

    } while (next_permutation(perm.begin(),perm.end()));
    
    cout << "No" << '\n';

	return 0;
}