#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, x;
	cin >> n >> x;
	vector<tuple<int, int, int>> vec(n);
	for (int i = 0; i < n; ++i) {
		cin >> get<1>(vec[i]) >> get<2>(vec[i]) >> get<0>(vec[i]);
	}
	sort(vec.begin(), vec.end());
	vector<int> p(n), v(n), c(n);
	for (int i = 0; i < n; ++i) {
		auto [c_i, p_i, v_i] = vec[i];
		c[i] = c_i;
		p[i] = p_i;
		v[i] = v_i;
	}

	vector<vector<long long>> dp(n + 1, vector<long long>(x + 1, 0));

	for (int j = 0; j <= x; ++j) {
		dp[0][j] = 0;
	}

	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j <= x; ++j) {
			dp[i][j] = dp[i - 1][j];
			if (j - p[i - 1] >= 0) {
				dp[i][j] = max(dp[i][j], dp[i - 1][j - p[i - 1]] + v[i - 1]);
			}
		}
	}	

	long long ans = 0;

	for (int i = 1; i <= n; ++i) {
		ans = max(ans, dp[i][x - c[i - 1]]);
	}

	cout << ans << endl;
}