#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,pair<ll,int>> pii;
int n,k;

ll dp[4005];
ll ans = 0;
pii t[4005];

bool cmp(pii a, pii b){
    return a.second.second > b.second.second;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        int a,c; ll b; cin >> a >> b >> c;
        t[i] = make_pair(a,make_pair(b,c));
    }
    sort(t + 1, t + n + 1,cmp);

    for(int i = 1; i <= n; i++){
        int a = t[i].first;
        ll b = t[i].second.first;
        int c = t[i].second.second;
        for(int j = k - a; j > 0; j--){
            if(dp[j] != 0){
                dp[j + a] = max(dp[j + a],dp[j] + b);
                ans = max(ans,dp[j + a]);
            }
        }
        if(c + a <= k){
            dp[c + a] = max(dp[c + a],b);
            ans = max(ans,dp[c + a]);
        }
    }
    cout << ans << endl;
}