#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<vector>

 using namespace std;

 #define fi first

 #define se second

 #define mp make_pair

 #define pb push_back

 typedef long long ll;

 typedef unsigned long long ull;

 typedef pair<ll,ll> pll;

 ll ans[],an2;

 //前i个物品，用j的容量的最大价值

 vector<pll> dd;

 ll n,m;

 int main()

 {

     ll idx,i,j,k,a,b,c;

     scanf("%lld%lld",&n,&m);

     for(i=;i<=n;i++)

     {

         scanf("%lld",&idx);

         if(idx==)

         {

             scanf("%lld%lld",&a,&b);

             dd.pb(mp(a,b));

         }

         else if(idx==)

         {

             scanf("%lld%lld%lld",&a,&b,&c);

             if(b==)

             {

                 for(j=;j<=m;j++)    ans[j]+=a*c;

             }

             else

             {

                 for(j=m;j>=;j--)

                 {

                     for(k=min(c,j/b);k>=;k--)

                     {

                         ans[j]=max(ans[j],ans[j-k*b]+k*a);

                     }

                 }

             }

         }

         else if(idx==)

         {

             scanf("%lld%lld",&a,&b);

             if(b==)    exit(-);

             else

             {

                 for(j=b;j<=m;j++)

                 {

                     ans[j]=max(ans[j],ans[j-b]+a);

                 }

             }

         }

         //for(int i=0;i<=m;i++)    printf("a%lld %lld\n",i,ans[i]);

     }

     for(i=;i<=m;i++)    ans[i]=max(ans[i],ans[i-]);

     an2=ans[m];

     for(i=;i<dd.size();i++)

     {

         for(j=;j<=m;j++)

         {

             an2=max(an2,ans[m-j]+dd[i].fi*j*j-dd[i].se*j);

         }

     }

     printf("%lld",an2);

     return ;

 }