#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<stack>

using namespace std;

const long long oo=1e9;
struct node
{
    long long t,v,l;
};
node a[100];
long long sum[100],ans,n,w;

bool cmp(node x,node y)
{
    return x.l-x.t<y.l-y.t;
}

void dfs(long long pos,long long t,long long point)
{
    if(point+sum[pos]<w||t>=ans)
        return;
    if(point>=w)
    {
        ans=t;
        return;
    }
    dfs(pos+1,max(t+a[pos].t,a[pos].l),point+a[pos].v);
    dfs(pos+1,t,point);
}

int main()
{
    while(cin>>n>>w)
    {
        for(int i=0;i<n;i++)
            cin>>a[i].t>>a[i].v>>a[i].l;
        sort(a,a+n,cmp);
        sum[n]=0;
        for(int i=n-1;i>=0;i--)
            sum[i]=sum[i+1]+a[i].v;
        if(sum[0]<w)
        {
            cout<<"zhx is naive!"<<endl;
            continue;
        }
        ans=oo;
        dfs(0,0,0);
        cout<<ans<<endl;
    }
    return 0;
}