#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <string>
using namespace std;

int sum = 0;
int* w = new int[1003];
int* l = new int[1003];
int* u = new int[1003];
int* f = new int[1003];

int main() {
	int n, x; cin >> n >> x;
	for (int i = 1; i <= n; i++) {
		cin >> l[i] >> w[i] >> u[i];
	}
	memset(f, 0, sizeof(f));
	for (int i = 1; i <= n; ++i) {
		for (int j = x; j >= 0; --j) {
			if (u[i] <= j) {
				f[j] = max(f[j]+l[i], f[j - u[i]] + w[i]);
			}
			else f[j] = f[j] + l[i];
		}
	}
	cout << 5*f[x];
}