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

ll dp[4002][4002];
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,b,c; 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++){
        for(int j = 1; j <= k; j++){
            dp[i][j] = max(dp[i][j - 1],dp[i - 1][j]);
            int a = t[i].first; int b = t[i].second.first; int c = t[i].second.second;
            if(j >= a && dp[i - 1][j - a] > 0){
                dp[i][j] = max(dp[i][j],dp[i - 1][j - a] + b);
            }
            else if(j >= a + c && dp[i - 1][j - a - c] == 0){
                dp[i][j] = max(dp[i][j],1ll*b);
            }
        }
    }
    cout << dp[n][k] << endl;
}