#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, d; cin >> n >> d;
	vector<int>a(n), b(n), c(n);
	rep(i, n)cin >> a[i] >> b[i] >> c[i];
	vector dp(1 << n, vector<int>(d + 1, INF));
	rep(i, n) dp[1 << i][min(d, a[i] + b[i])] = a[i] + b[i] + c[i];
	rep(i, 1 << n)rep(j, d + 1) if (dp[i][j] != INF) {
		int st = 0;
		rep(k, n) if (i & (1 << k)) st += a[k];
		rep(k, n) {
			if (i & (1 << k)) continue;
			vector<int>q(3);
			q[0] = st + a[k];
			q[1] = max(q[0], j) + b[k];
			q[2] = max(q[1], dp[i][j]) + c[k];
			chmin(dp[i + (1 << k)][min(d, q[1])], q[2]);
		}
	}
	int mn = INF;
	rep(i, d + 1)chmin(mn, dp.back()[i]);
	if (mn <= d)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}