#include <iostream>

#include <cstring>

#include <algorithm>

using namespace std;

// (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000),  (1 ≤ Pi ≤ Qi ≤ 100, 1 ≤ Vi ≤ 1000),

int p[505], q[505], v[505];

int dp[5005];

/**

n个物品，有qi的钱才能买,需要花费pi,价值vi,求最大价值

直接01背包会出错，需要排序。

排序时考虑其中两个物品i,j

买i,j和买j,i分别需要max(q[i], p[i]+q[j]) max(q[j], p[j]+q[i])

*/

struct node{

    int p, q, v;

    bool operator < (const node a) const

    {

        //return q > a.q;

        int x = max(q, p + a.q);

        int y = max(a.q, a.p + q);

        return x > y;

    }

} a[505];

int main()

{

    int n, m;

    while (cin >> n >> m)

    {

        for (int i = 0; i < n; ++i)

            cin >> a[i].p >> a[i].q >> a[i].v;

        sort(a, a + n);

        memset(dp, 0, sizeof dp);

        for (int i = 0; i < n; ++i)

        {

            for (int j = m; j >= a[i].q; --j)

            {

                dp[j] = max(dp[j], dp[j - a[i].p] + a[i].v);

            }

        }

        cout << dp[m] << endl;

    }

    return 0;

}