#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4010;
int n, T, t[N], p[N], d[N];
int f[N][N];
inline void UpdMax(int &x, int y) {
    x = max(x, y);
}
inline int Sqr(int x) {
    return x * x;
}
inline void Solve(int i, int pl, int pr, int chol, int chor) {
    int pm = (pl + pr) >> 1;
    int cho = chol, bst = -1e15;
    for (int j = chol; j <= chor && j < pm; ++j) {
        int nval = f[i][j] + p[pm] - Sqr(d[j] - d[pm]);
        if (nval > bst) bst = nval, cho = j;
    }
    if (i + t[pm] <= T) UpdMax(f[i + t[pm]][pm], bst);
    if (pl < pm) Solve(i, pl, pm - 1, chol, cho);
    if (pm < pr) Solve(i, pm + 1, pr, cho, chor);
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> T;
    vector<tuple<int, int, int>> vec;
    for (int i = 1, x, y, z; i <= n; ++i) {
        cin >> x >> y >> z;
        vec.push_back({z, x, y});
    }
    sort(vec.begin(), vec.end());
    for (int i = 1; i <= n; ++i) {
        auto [z, x, y] = vec[i - 1];
        t[i] = x; p[i] = y; d[i] = z;
    }
    memset(f, -1, sizeof f);
    for (int i = 0; i <= T; ++i) {
        for (int j = 1; j <= n; ++j) if (i >= t[j]) UpdMax(f[i][j], p[j]);
        Solve(i, 1, n, 1, n);
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i) ans = max(ans, f[T][i]);
    cout << ans << endl;
    return 0;
}