#include<bits/stdc++.h>
#define fi first
#define se second
#define m_p make_pair
#define ll long long
#define tc int _TC_; cin >> _TC_; while(_TC_--)
using namespace std;
bool comp(vector<int> a, vector<int> b){
    return a[2] < b[2];
}
int main(){
    int n,k;
    cin >> n >> k;
    vector<vector<int> > a(n);
    for(int i = 0; i < n;i++){
        a[i].resize(3);
        int p,v,t;
        cin >> p >> v >> t;
        a[i][0]=p;
        a[i][1]=v;
        a[i][2]=t;
    }
    sort(a.begin(), a.end(), comp);
    vector<int> b(k+1), b2(k+1);
    int me=0;
    for(int i = 1; i <= k;i++){
        b[i]=0;
        b2[i]=0;
    }
    for(int i = 0; i < n; i++){
        if(a[i][0]+a[i][2] <= k){
            b2=b;
            for(int j = k-a[i][0]-a[i][2]; j >=1 ; j--){

                if(b[j] != 0 && j+a[i][0]+a[i][2] <= k){
                    b2[j+a[i][0]] = max(b[j]+a[i][1], b[j+a[i][0]]);
                    me=max(me, b2[j+a[i][0]]); //cout << "\n\n\n\n" << j << "     " << b[j];
                    //cout << me << endl;
                }
            }
            b=b2;
            b[a[i][0]]=max(b[a[i][0]], a[i][1]);
            me=max(me, b[a[i][0]]);

        }
    }
    /*cout << "\n\n\n\n\n";
    for(int i = 0; i <= k; i++){
        cout << b[i] << endl;
    }*/
    cout << me << endl;
}