#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> // using mint = modint998244353; template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } int main() { ll N, M; cin >> N >> M; vector A(N); vector B(N); vector C(N); for (ll i = 0; i < N; i++) { cin >> A[i] >> B[i] >> C[i]; } // 交換するたびに飲む、としても OK // 個数制限なしナップサック問題 ll INF = 1000000000000000023; vector dp(M + 1, -INF); dp[0] = 0; for (ll i = 0; i < N; i++) { vector dp1(M + 1, -INF); for (ll j = 0; j <= M; j++) { if (j + A[i] <= M) { dp1[j + A[i]] = max(dp1[j + A[i]], dp[j] + B[i] * C[i]); } } for (ll j = 0; j <= M; j++) { if (j + (A[i] - B[i]) <= M) { dp1[j + A[i] - B[i]] = max(dp1[j + A[i] - B[i]], dp1[j] + B[i] * C[i]); } } for (ll j = 0; j <= M; j++) { dp[j] = max(dp[j], dp1[j]); } } ll ans = 0; for (ll i = 1; i <= M; i++) { ans = max(ans, dp[i]); cout << ans << endl; } }