#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
};
void phongbeo();
const int inf = 1e9;
int mod2 = 1e6+3;
const int mod1 = 998244353;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0) x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk,invf;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
///modwwe
phongbeo();
// checktime
}
ic a[300001];
vector<ic> v;
struct IT
{
int t[1200001];
int t2[1200001];
void ff(int x)
{
for(int i=x*2; i<=x*2+1; i++)
{
t[i]+=t2[x];
t2[i]+=t2[x];
}
t2[x]=0;
}
void build(int node,int l,int r )
{
if(l==r)
{
t[node]=-a[l].a;
return;
}
int mid=l+r>>1;
build(node<<1,l,mid);
build(node<<1|1,mid+1,r);
t[node]=min(t[node<<1],t[node<<1|1]);
}
void upd(int node,int l,int r,int l1,int r1,int x)
{
if(l>r1||r<l1) return;
if(l>=l1&&r<=r1)
{
t[node]+=x;
t2[node]+=x;
return;
}
if(t2[node]!=0)ff(node);
int mid=l+r>>1;
upd(node<<1,l,mid,l1,r1,x);
upd(node<<1|1,mid+1,r,l1,r1,x);
t[node]=min(t[node<<1],t[node<<1|1]);
}
}st;
bool cmp(ic a,ic b)
{
return a.a<b.a;
}
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i].a>>a[i].b>>a[i].c,
swap(a[i].b,a[i].c);
n++;
a[n].a=m;
sort(a+1,a+1+n,cmp);
st.build(1,1,n);
for(int i=1;i<=n-1;i++){
st.upd(1,1,n,i+1,n,a[i].c),
v.pb({a[i].b,a[i].c,i});
}
sort(v.begin(),v.end(),cmp);
for(int i=0;i<v.size();i++)
{
s8=st.t[1];
if(v[i].a+s8>=0)
{
cout<<-s8;
return;
}
st.upd(1,1,n,v[i].c+1,n,-v[i].b);
}
cout<<m;
}
