rt

#include<bits/stdc++.h>
using namespace std;
const int N = 1e4 + 100;
int w[N], l[N], u[N], dp[N];
int main()
{
	int n, k;
	cin >> n >> k; 
	for (int i = 1; i <= n; i ++) {
		cin >> l[i] >> w[i] >> u[i];
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = k; j >= 0; j --) {
			if(j >= u[i])
				dp[j] = max(dp[j] + l[i], dp[j - u[i]] + w[i]);
			else
				dp[j] += l[i];
		}
	}
	cout << dp[n] * 5;
    return 0;
}