#include <bits/stdc++.h>
#define int long long
#define zet ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int N = 6e4+555, M = 1e6+557, mod = 1e9+7;
int n, k, l[N], r[N], a[N], dp[N][5];
vector <int> st;
bool res;
vector <pair<int, int>>mp;
bool comp(pair<int, int> a, pair<int, int> b) {
return a.second <= b.second;
}
signed main() {
zet
cin >> n >> k;
for (int i = 0; i < 2*n; i++) {
cin >> l[i] >> r[i] >> a[i];
}
for (int mk = 1; mk < (1 << 2*n); mk++) {
int cnt = 0;
for (int i = 0; i < 2*n; i++) {
if ((1<<i)&mk) cnt++;
}
if (cnt != n) continue;
int ans = 0;
for (int i = 0; i < 2*n; i++) {
if ((1<<i) & mk) ans+= l[i];
else ans -= r[i];
}
if (abs(ans) <= k){
res = 1;
break;
}
}
cout << ((res) ? "YES" : "NO");
}
