#include <iostream>
using namespace std;
const int N=1e4+10;
long long lo[N],w[N],wi[N],dp[N][N];
int main()
{
    int n,x;
    cin>>n>>x;
    for(int i=1;i<=n;i++)
    {
        cin>>lo[i]>>wi[i]>>w[i];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=x;j++)
        {
            dp[i][j]=dp[i-1][j]+lo[i];
            if(j>=w[i])
            {
                dp[i][j]=max(dp[i][j],dp[i-1][j-w[i]]+wi[i]);
            }
            cout<<dp[i][j]<<" ";
        }
        cout<<endl;
    }
    cout<<dp[n][x]*5;
    return 0;
}