//next_permutation全排列
# include 
  
   
# include 
   
     # include 
    
      using namespace std; struct node { int w; int v; }; struct node a[10010]; int max1(int x,int y) { return x>y?x:y; } int main() { int i,n,d,flag,x1,y1,ans,max; int t[10010]; while(~scanf("%d%d",&n,&d)) { for(i=0;i
     
      y1+d) flag=0; } else { y1+=a[t[i]].w; ans+=a[t[i]].v; if(y1>x1+d) flag=1; } } max=max1(max,ans); }while(next_permutation(t,t+n)); printf("%d\n",max); } return 0; }
     
    
   
  

// dfs
# include 
  
   
# include 
   
     # include 
    
      using namespace std; struct node { int w; int v; }; struct node a[10010]; int n,d,maxa; int vis[10010]; int max1(int x,int y) { return x>y?x:y; } void dfs(int w1,int w2,int v2,int ans,int flag) { if(ans==n) { maxa=max1(maxa,v2); return ; } else { for(int i=0;i
     
      d+w2) { dfs(w1,w2+a[i].w,v2+a[i].v,ans+1,0); } else if(flag&&w1<=d+w2) { dfs(w1+a[i].w,w2,v2,ans+1,1); } else if(!flag&&w2>d+w1) { dfs(w1+a[i].w,w2,v2,ans+1,1); } else if(!flag&&w2<=d+w1) { dfs(w1,w2+a[i].w,v2+a[i].v,ans+1,0); } vis[i]=0; } } } return ; } int main() { while(~scanf("%d%d",&n,&d)) { for(int i=0;i