#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<long long> dp(x + 1);
	long long ans = 0;

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

	cout << ans << endl;
}