1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 const int maxn=35;
 6 long long sum[maxn];
 7 int n,w;
 8 struct node
 9 {
10     int t,v,l;
11     void input()
12     {
13         scanf("%d%d%d",&t,&v,&l);
14     }
15     friend bool operator<(node a,node b)
16     {
17         return a.l-a.t<b.l-b.t;
18     }
19 }q[maxn];
20 bool dfs(int p,int tot,long long va)
21 {
22     if(va>=w)   return 1;
23     if(p<0) return 0;
24     if(va+sum[p]<w) return 0;   //如果加上剩下的价值仍小于w
25     if(tot-q[p].l>=0&&tot-q[p].t>=0)    if(dfs(p-1,tot-q[p].t,va+q[p].v))   return 1;
26     if(dfs(p-1,tot,va)) return 1;
27     return 0;
28 }
29 int main()
30 {
31     #ifndef ONLINE_JUDGE
32     freopen("1.in","r",stdin);
33     #endif
34     int i,j,k;
35     while(scanf("%d%d",&n,&w)!=EOF)
36     {
37         for(i=0;i<n;i++)    q[i].input();
38         sort(q,q+n);
39         /*for(int i=0;i<n;i++)
40         {
41             printf("%d %d %d\n",q[i].t,q[i].v,q[i].l);
42         }*/
43         for(i=0;i<n;i++)
44         {
45             if(i==0)    sum[i]=q[i].v;
46             else sum[i]=sum[i-1]+q[i].v;
47         }
48         if(sum[n-1]<w)
49         {
50             printf("zhx is naive!\n");
51             continue;
52         }
53         int l=0,r=100000*n;  //最高用时
54         int ans;
55         while(l<=r)
56         {
57             int mid=(l+r)>>1;
58             if(dfs(n-1,mid,0))  r=mid-1,ans=mid;
59             else l=mid+1;
60         }
61         printf("%d\n",ans);
62     }
63 }