#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <climits>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <unordered_map>
#include <numeric>
#include <random>
#include <memory>
#include <chrono>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <cassert>
#include <cstring>
#include <bitset>
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x...)
#endif
//#define int ll

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef pair < ll, ll > pll;
#define sz(x) int((x).size())

#ifndef LOCAL
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#else
mt19937 rng(228);
#endif

const int N = 2e6 + 7;
const int inf = INT_MAX / 2;
const ll INF = LLONG_MAX / 3;
const int MOD = 1e9 + 7;
const double eps = 1e-6;
const string cars[] = {"🚗", "🚕", "🚙"};

const int M = 1e2 + 7;

ll dp[N];
int l[M], r[M], c[M], n, a;
deque < ll > d[M];

signed main() {
    //debug(true);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
#endif
    cout << fixed << setprecision(4);
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    cin >> n >> a;

    for (int i = 0; i < n; i++) {
        cin >> l[i] >> r[i] >> c[i];
    }

    for (int i = a; i >= 0; i--) {
        dp[i] = 1000000000LL * i;

        for (int j = 0; j < n; j++) {
            if (i + l[j] > a) {
                continue;
            }
            ll t = dp[i + l[j]];


            while (!d[j].empty() && d[j].back() > t) {
                d[j].pop_back();
            }
            d[j].push_back(t);

            if (i + r[j] <= a) {
                dp[i] = max(dp[i], d[j].front() - c[j]);

                if (d[j].front() == dp[i + r[j]]) {
                    d[j].pop_front();
                }
            }
        }
    }

    cout << dp[0] << endl;

    return 0;
}