#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

struct haz {
    int p, v, t;
};

int n, k, ans = 0;
vector <haz> v;
vector <int> dp(5e3, 0);

bool r(haz a, haz b) {
    return (a.t < b.t ? true : false);
}

int main()
{
    cin >> n >> k;
    v.resize(n);
    for (haz& h : v) cin >> h.p >> h.v >> h.t;
    sort(v.begin(), v.end(), r);
    for (haz& h : v) {
        for (int i = k - h.t; i >= h.p; i--) {
            dp[i] = max(dp[i], dp[i - h.p] + h.v);
            ans = max(ans, dp[i]);
        }
    }
    cout << ans;
}