#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long

int main(){

  int n,w;
  cin >> n >> w;

  vector<int> s(n),t(n),p(n);
  for(int i=0; i<n; ++i)
    cin >> s[i] >> t[i] >> p[i];

  vector<ll> oyu(*max_element(t.begin(), t.end()),0);

  for(int i=0; i<n; ++i) {
    oyu[s[i]] += p[i];
    oyu[t[i]] -= p[i];
  }

  for(int i=1; i<oyu.size(); ++i)
    oyu[i] += oyu[i-1];

  
  cout << (*max_element(oyu.begin(), oyu.end())>w ? "No" : "Yes") << endl;



}

// Pratiyush Mishra

#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define mem1(a) memset(a, -1, sizeof(a))
#define popf pop_front
#define p() cout << '\n'
#define p0(x) cout << x << " "
#define p1(x) cout << x << '\n'
#define p2(x, y) cout << x << " " << y << '\n'
#define p3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define printv(v)                   \
  for (ll i = 0; i < v.size(); ++i) \
    cout << v[i] << " ";            \
  cout << '\n'
#define pr1(x) cout << fixed << setprecision(15) << x << '\n'
#define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
// ordered_set s ; s.order_of_key(val)  no. of elements strictly less than val
// s.find_by_order(i)  itertor to ith element (0 indexed)
#define mod 1000000007
#define mod1 998244353
#define fio                         \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define get(n) \
  ll n;        \
  cin >> n
#define getvec(v, n)         \
  vector<ll> v(n);           \
  for (ll i = 0; i < n; i++) \
    cin >> v[i];
#define getstr(s) \
  string s;       \
  cin >> s
#define all(x) x.begin(), x.end()
#define countBits(x) __builtin_popcount(x)
using namespace std;


const ll M = 2e5;

void mainSolve()
{
  get(n);
  get(w);
  vl v(M + 1, 0);
  for (int i = 0; i < n; i++)
  {
    ll p, s, e;
    cin >> s >> e >> p;
    v[s] += p;
    v[e] -= p;
  }
  for (int i = 1; i <= M; i++)
    v[i] += v[i - 1];
  for (ll x : v)
  {
    if (x > w)
    {
      p1("No");
      return;
    }
  }
  p1("Yes");
}

int main()
{
  fio;
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  //get(t);
  ll t = 1;
  while (t--)
  {
    mainSolve();
  }
  return 0;
}
