#include <bits/stdc++.h>

using namespace std;

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

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<=d;j++)
        {
            dp[i][j] = 1e9;
        }
    }

    dp[0][0] = 0;

    for(int i=0;i<(1<<n);i++)
    {
        int A = 0;
        for(int j=0;j<n;j++)
        {
            if((i&(1<<j))) A += a[j];
        }

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

    for(int i=0;i<=d;i++)
    {
        if(dp[(1<<n)-1][i] <= d)
        {
            cout << "Yes" << '\n';
            return 0;
        }
    }

    cout << "No" << '\n';
    
	return 0;
}