#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
void solve(){
int n, d; cin >> n >> d;
vector <tiii> que(n + 1);
set <int> s;
for (int i = 1; i <= n; i++) {
auto &[x, aa, bb] = que[i]; cin >> x >> aa >> bb;
s.emplace(bb);
}
sort(all(que));
int l = 1, r = d;
for (auto e : s) {
int cur = e;
int prev = 0;
bool ok = 1;
for (int i = 1; i <= n; i++) {
auto [x, a, b] = que[i];
int len = x - prev;
if (cur < len) {
ok = 0;
break;
}
cur -= len;
prev = x;
if (e > b) continue;
cur += a;
}
if (ok && d - prev <= cur) {
r = e;
break;
}
l = e + 1;
}
int ans = inf;
while (l <= r) {
int mid = (l + r) / 2;
int cur = mid;
int prev = 0;
bool ok = 1;
for (int i = 1; i <= n; i++) {
auto [x, a, b] = que[i];
int len = x - prev;
if (cur < len) {
ok = 0;
break;
}
cur -= len;
prev = x;
if (mid > b) continue;
cur += a;
}
if (ok && d - prev <= cur) ans = mid, r = mid - 1;
else l = mid + 1;
}
cout << ans;
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
