#include <stdio.h> int main () { int n = 0; int m = 0; int a[5000] = {}; int b[5000] = {}; long long c[5000] = {}; int res = 0; long long ans[5001] = {}; long long dp[5000][5001] = {}; res = scanf("%d", &n); res = scanf("%d", &m); for (int i = 0; i < n; i++) { res = scanf("%d", a+i); res = scanf("%d", b+i); res = scanf("%lld", c+i); } for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { if (i+1 >= a[j] && ans[i+1] < dp[j][i+1-a[j]]+((long long)b[j])*c[j]) { ans[i+1] = dp[j][i+1-a[j]]+((long long)b[j])*c[j]; } } for (int j = 0; j < n; j++) { dp[j][i+1] = ans[i+1]; if (i+1 >= a[j]-b[j] && dp[j][i+1] < dp[j][i+1-a[j]+b[j]]+((long long)b[j])*c[j]) { dp[j][i+1] = dp[j][i+1-a[j]+b[j]]+((long long)b[j])*c[j]; } } printf("%lld\n", ans[i+1]); } return 0; }