#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a) 
#define dumparr(a,n) 
#endif
#define FOR(i, a, b) for(ll i = (ll)a;i < (ll)b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(ll i = (ll)b-1LL;i >= (ll)a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define SIGN(a) (a==0?0:(a>0?1:-1))

typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll,pll> ppll;
typedef vector<ll> vll;
typedef long double ld;
typedef pair<ld,ld> pdd;

pll operator+(pll a,pll b){
  return pll(a.first+b.first,a.second+b.second);
}
pll operator-(pll a,pll b){
  return pll(a.first-b.first,a.second-b.second);
}
pll operator*(ll a,pll b){
  return pll(b.first*a,b.second*a);
}
const ll INF=(1LL<<60);
#if __cplusplus<201700L
ll gcd(ll a, ll b) {
  a=abs(a);
  b=abs(b);
  if(a==0)return b;
  if(b==0)return a;
  if(a < b) return gcd(b, a);
  ll r;
  while ((r=a%b)) {
    a = b;
    b = r;
  }
  return b;
}
#endif
template<class T>
bool chmax(T& a,const T& b){
  if(a<b){
    a=b;
    return true;
  }
  return false;
}
template<class T>
bool chmin(T& a,const T& b){
  if(a>b){
    a=b;
    return true;
  }
  return false;
}
template<class S,class T>
std::ostream& operator<<(std::ostream& os,pair<S,T> a){
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template<class T>
std::ostream& operator<<(std::ostream& os,vector<T> a){
  os << "[ ";
  REP(a.size()){
    os<< a[i] << " ";
  }
  os<< " ]";
  return os;
}

const string YES = "Yes";
const string NO = "No";

void solve(long long N, long long W, std::vector<long long> S, std::vector<long long> T, std::vector<long long> P){
  vector<ll> time(200002);
  REP(N){
    time[S[i]]+=P[i];
    time[T[i]]-=P[i];
  }
  REP(time.size()-1){
    time[i+1]+=time[i];
  }
  REP(time.size()){
    if(time[i]>W){
      cout<<NO<<endl;
      return;
    }
  }
  cout<<YES<<endl;
}

int main(){
  cout<<setprecision(1000);
    long long N;
    scanf("%lld",&N);
    long long W;
    scanf("%lld",&W);
    std::vector<long long> S(N);
    std::vector<long long> T(N);
    std::vector<long long> P(N);
    for(int i = 0 ; i < N ; i++){
        scanf("%lld",&S[i]);
        scanf("%lld",&T[i]);
        scanf("%lld",&P[i]);
    }
    solve(N, W, std::move(S), std::move(T), std::move(P));
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int main(){
    int64_t n, w;
    cin >> n >> w;
    vector<int> s(n);
    vector<int> t(n);
    vector<int64_t> p(n);
    vector<int64_t> sum(2000005);
    string ans = "Yes";

    for(int i = 0;i < n;i++){
        cin >> s.at(i) >> t.at(i) >> p.at(i);
        sum.at(s.at(i))+=p.at(i);
        sum.at(t.at(i))-=p.at(i);
    }

    for(int i = 0;i < sum.size()-1;i++){
        sum.at(i+1) += sum.at(i);
        if(sum.at(i) > w){
            ans = "No";
        }
    }
    cout << ans << endl;

}